./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 391f5d8b898ab2981d898384ae502b469bbad72d3843c4719f1b24203d9f9914 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:12:35,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:12:35,854 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:12:35,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:12:35,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:12:35,890 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:12:35,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:12:35,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:12:35,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:12:35,894 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:12:35,894 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:12:35,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:12:35,895 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:12:35,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:12:35,895 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:12:35,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:12:35,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:12:35,898 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:12:35,899 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:12:35,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:12:35,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:12:35,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:12:35,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:12:35,900 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:12:35,900 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:12:35,900 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:12:35,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:12:35,900 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:12:35,901 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:12:35,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:12:35,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:12:35,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:12:35,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:12:35,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:12:35,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:12:35,902 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:12:35,902 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:12:35,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:12:35,902 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:12:35,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:12:35,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:12:35,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:12:35,905 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 391f5d8b898ab2981d898384ae502b469bbad72d3843c4719f1b24203d9f9914 [2024-10-11 13:12:36,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:12:36,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:12:36,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:12:36,169 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:12:36,169 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:12:36,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i [2024-10-11 13:12:37,456 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:12:37,613 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:12:37,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i [2024-10-11 13:12:37,622 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e0038bf89/6f9d7ba308d44b24bc427a3bf5ffa0e4/FLAGc54124500 [2024-10-11 13:12:38,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e0038bf89/6f9d7ba308d44b24bc427a3bf5ffa0e4 [2024-10-11 13:12:38,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:12:38,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:12:38,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:12:38,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:12:38,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:12:38,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:12:38" (1/1) ... [2024-10-11 13:12:38,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c75b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:38, skipping insertion in model container [2024-10-11 13:12:38,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:12:38" (1/1) ... [2024-10-11 13:12:38,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:12:38,199 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i[913,926] [2024-10-11 13:12:38,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:12:38,257 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:12:38,266 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i[913,926] [2024-10-11 13:12:38,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:12:38,310 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:12:38,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:38 WrapperNode [2024-10-11 13:12:38,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:12:38,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:12:38,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:12:38,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:12:38,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:38" (1/1) ... [2024-10-11 13:12:38,322 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:38" (1/1) ... [2024-10-11 13:12:38,341 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2024-10-11 13:12:38,341 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:12:38,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:12:38,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:12:38,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:12:38,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:38" (1/1) ... [2024-10-11 13:12:38,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:38" (1/1) ... [2024-10-11 13:12:38,352 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:38" (1/1) ... [2024-10-11 13:12:38,364 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 13:12:38,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:38" (1/1) ... [2024-10-11 13:12:38,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:38" (1/1) ... [2024-10-11 13:12:38,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:38" (1/1) ... [2024-10-11 13:12:38,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:38" (1/1) ... [2024-10-11 13:12:38,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:38" (1/1) ... [2024-10-11 13:12:38,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:38" (1/1) ... [2024-10-11 13:12:38,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:12:38,381 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:12:38,381 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:12:38,381 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:12:38,382 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:38" (1/1) ... [2024-10-11 13:12:38,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:12:38,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:12:38,419 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:12:38,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:12:38,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:12:38,462 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:12:38,462 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:12:38,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:12:38,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:12:38,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:12:38,539 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:12:38,540 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:12:38,794 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 13:12:38,794 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:12:38,850 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:12:38,850 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:12:38,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:12:38 BoogieIcfgContainer [2024-10-11 13:12:38,851 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:12:38,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:12:38,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:12:38,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:12:38,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:12:38" (1/3) ... [2024-10-11 13:12:38,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d5fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:12:38, skipping insertion in model container [2024-10-11 13:12:38,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:38" (2/3) ... [2024-10-11 13:12:38,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d5fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:12:38, skipping insertion in model container [2024-10-11 13:12:38,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:12:38" (3/3) ... [2024-10-11 13:12:38,863 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-98.i [2024-10-11 13:12:38,878 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:12:38,879 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:12:38,939 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:12:38,946 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2b12cd1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:12:38,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:12:38,952 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:12:38,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 13:12:38,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:12:38,963 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:12:38,964 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:12:38,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:12:38,968 INFO L85 PathProgramCache]: Analyzing trace with hash 247280691, now seen corresponding path program 1 times [2024-10-11 13:12:38,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:12:38,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229060609] [2024-10-11 13:12:38,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:12:38,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:12:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:39,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:12:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:39,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:12:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:39,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:12:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:39,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 13:12:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:39,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 13:12:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:39,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 13:12:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:39,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:12:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:39,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:12:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:39,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:12:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:39,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:12:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:39,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:12:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:39,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:12:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:39,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 13:12:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:39,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 13:12:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:39,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 13:12:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:39,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 13:12:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:39,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:12:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:39,298 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:12:39,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:12:39,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229060609] [2024-10-11 13:12:39,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229060609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:12:39,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:12:39,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:12:39,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416803516] [2024-10-11 13:12:39,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:12:39,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:12:39,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:12:39,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:12:39,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:12:39,326 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:12:39,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:12:39,361 INFO L93 Difference]: Finished difference Result 105 states and 177 transitions. [2024-10-11 13:12:39,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:12:39,364 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2024-10-11 13:12:39,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:12:39,370 INFO L225 Difference]: With dead ends: 105 [2024-10-11 13:12:39,370 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 13:12:39,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:12:39,375 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:12:39,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:12:39,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 13:12:39,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-11 13:12:39,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:12:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2024-10-11 13:12:39,434 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 108 [2024-10-11 13:12:39,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:12:39,438 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2024-10-11 13:12:39,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:12:39,439 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2024-10-11 13:12:39,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 13:12:39,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:12:39,441 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:12:39,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:12:39,441 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:12:39,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:12:39,442 INFO L85 PathProgramCache]: Analyzing trace with hash 60535929, now seen corresponding path program 1 times [2024-10-11 13:12:39,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:12:39,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756941595] [2024-10-11 13:12:39,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:12:39,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:12:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:12:39,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1416175538] [2024-10-11 13:12:39,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:12:39,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:12:39,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:12:39,629 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:12:39,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:12:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:12:39,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:12:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:12:39,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:12:39,950 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:12:39,951 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:12:39,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:12:40,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:12:40,159 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 13:12:40,235 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:12:40,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:12:40 BoogieIcfgContainer [2024-10-11 13:12:40,240 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:12:40,240 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:12:40,240 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:12:40,241 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:12:40,241 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:12:38" (3/4) ... [2024-10-11 13:12:40,243 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:12:40,244 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:12:40,247 INFO L158 Benchmark]: Toolchain (without parser) took 2222.10ms. Allocated memory was 136.3MB in the beginning and 190.8MB in the end (delta: 54.5MB). Free memory was 65.5MB in the beginning and 122.8MB in the end (delta: -57.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:12:40,247 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 136.3MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:12:40,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.35ms. Allocated memory was 136.3MB in the beginning and 190.8MB in the end (delta: 54.5MB). Free memory was 65.4MB in the beginning and 162.7MB in the end (delta: -97.3MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2024-10-11 13:12:40,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.04ms. Allocated memory is still 190.8MB. Free memory was 162.7MB in the beginning and 160.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:12:40,248 INFO L158 Benchmark]: Boogie Preprocessor took 38.91ms. Allocated memory is still 190.8MB. Free memory was 160.6MB in the beginning and 158.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:12:40,249 INFO L158 Benchmark]: RCFGBuilder took 469.70ms. Allocated memory is still 190.8MB. Free memory was 158.5MB in the beginning and 139.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 13:12:40,249 INFO L158 Benchmark]: TraceAbstraction took 1387.32ms. Allocated memory is still 190.8MB. Free memory was 138.6MB in the beginning and 123.8MB in the end (delta: 14.8MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2024-10-11 13:12:40,249 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 190.8MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:12:40,251 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 136.3MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.35ms. Allocated memory was 136.3MB in the beginning and 190.8MB in the end (delta: 54.5MB). Free memory was 65.4MB in the beginning and 162.7MB in the end (delta: -97.3MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.04ms. Allocated memory is still 190.8MB. Free memory was 162.7MB in the beginning and 160.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.91ms. Allocated memory is still 190.8MB. Free memory was 160.6MB in the beginning and 158.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 469.70ms. Allocated memory is still 190.8MB. Free memory was 158.5MB in the beginning and 139.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1387.32ms. Allocated memory is still 190.8MB. Free memory was 138.6MB in the beginning and 123.8MB in the end (delta: 14.8MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 190.8MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryArithmeticDOUBLEoperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 4.8; [L23] double var_1_2 = 63.5; [L24] double var_1_3 = 9999999.5; [L25] double var_1_4 = 0.6; [L26] signed short int var_1_6 = 10; [L27] signed long int var_1_7 = -1; [L28] double var_1_8 = 4.4; [L29] double var_1_9 = 7.25; [L30] double var_1_10 = 7.5; [L31] double var_1_11 = 2.3; [L32] unsigned long int var_1_12 = 128; [L33] unsigned long int var_1_13 = 0; [L34] unsigned long int var_1_14 = 4078799264; [L35] unsigned long int var_1_15 = 500; [L36] unsigned long int var_1_16 = 25; [L37] unsigned long int last_1_var_1_15 = 500; [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L94] last_1_var_1_15 = var_1_15 [L104] RET updateLastVariables() [L105] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_double() [L65] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_3=19999999/2, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_3=19999999/2, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L65] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_3=19999999/2, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L66] var_1_3 = __VERIFIER_nondet_double() [L67] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L67] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L68] var_1_6 = __VERIFIER_nondet_short() [L69] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L69] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L70] CALL assume_abort_if_not(var_1_6 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L70] RET assume_abort_if_not(var_1_6 <= 32) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L71] var_1_7 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=22/5, var_1_9=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=22/5, var_1_9=29/4] [L72] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=22/5, var_1_9=29/4] [L73] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=22/5, var_1_9=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=22/5, var_1_9=29/4] [L73] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=22/5, var_1_9=29/4] [L74] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=22/5, var_1_9=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=22/5, var_1_9=29/4] [L74] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=22/5, var_1_9=29/4] [L75] var_1_8 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=29/4] [L76] RET assume_abort_if_not((var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=29/4] [L77] var_1_9 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_9 >= -115292.1504606845700e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 1152921.504606845700e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L78] RET assume_abort_if_not((var_1_9 >= -115292.1504606845700e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 1152921.504606845700e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L79] var_1_10 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L80] RET assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=500, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L81] var_1_11 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_11 >= -230584.3009213691390e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 2305843.009213691390e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L82] RET assume_abort_if_not((var_1_11 >= -230584.3009213691390e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 2305843.009213691390e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L83] var_1_13 = __VERIFIER_nondet_ulong() [L84] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L84] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L85] CALL assume_abort_if_not(var_1_13 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L85] RET assume_abort_if_not(var_1_13 <= 4294967294) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L86] var_1_14 = __VERIFIER_nondet_ulong() [L87] CALL assume_abort_if_not(var_1_14 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L87] RET assume_abort_if_not(var_1_14 >= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L88] CALL assume_abort_if_not(var_1_14 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L88] RET assume_abort_if_not(var_1_14 <= 4294967294) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L89] var_1_16 = __VERIFIER_nondet_ulong() [L90] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L90] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L91] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_16=-4294967287, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_16=-4294967287, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L91] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_16=-4294967287, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L105] RET updateVariables() [L106] CALL step() [L41] var_1_1 = (var_1_2 - var_1_3) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_16=-4294967287, var_1_4=3/5, var_1_6=0, var_1_7=1] [L42] COND FALSE !(((((-128) < (last_1_var_1_15)) ? (-128) : (last_1_var_1_15))) < var_1_13) [L49] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=-4294967287, var_1_16=-4294967287, var_1_4=3/5, var_1_6=0, var_1_7=1] [L51] EXPR var_1_15 >> var_1_6 VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=-4294967287, var_1_16=-4294967287, var_1_4=3/5, var_1_6=0, var_1_7=1] [L51] unsigned long int stepLocal_0 = (var_1_15 >> var_1_6) / var_1_7; [L52] COND TRUE 8 < stepLocal_0 [L53] var_1_4 = (((var_1_8 + var_1_9) + ((((var_1_10) < (1.9)) ? (var_1_10) : (1.9)))) + (99.125 + var_1_11)) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=-4294967287, var_1_16=-4294967287, var_1_6=0, var_1_7=1] [L55] COND FALSE !(var_1_2 < var_1_8) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=-4294967287, var_1_16=-4294967287, var_1_6=0, var_1_7=1] [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR (var_1_1 == ((double) (var_1_2 - var_1_3))) && ((8 < ((var_1_15 >> var_1_6) / var_1_7)) ? (var_1_4 == ((double) (((var_1_8 + var_1_9) + ((((var_1_10) < (1.9)) ? (var_1_10) : (1.9)))) + (99.125 + var_1_11)))) : 1) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=-4294967287, var_1_16=-4294967287, var_1_6=0, var_1_7=1] [L97-L98] return (((var_1_1 == ((double) (var_1_2 - var_1_3))) && ((8 < ((var_1_15 >> var_1_6) / var_1_7)) ? (var_1_4 == ((double) (((var_1_8 + var_1_9) + ((((var_1_10) < (1.9)) ? (var_1_10) : (1.9)))) + (99.125 + var_1_11)))) : 1)) && ((var_1_2 < var_1_8) ? ((((- var_1_15) <= var_1_6) || (var_1_4 < var_1_10)) ? (var_1_12 == ((unsigned long int) ((((var_1_6) < (var_1_13)) ? (var_1_6) : (var_1_13))))) : (var_1_12 == ((unsigned long int) (var_1_14 - var_1_6)))) : 1)) && ((((((-128) < (last_1_var_1_15)) ? (-128) : (last_1_var_1_15))) < var_1_13) ? ((last_1_var_1_15 > var_1_7) ? (var_1_15 == ((unsigned long int) (var_1_6 + var_1_16))) : (var_1_15 == ((unsigned long int) var_1_14))) : (var_1_15 == ((unsigned long int) var_1_16))) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=-4294967287, var_1_16=-4294967287, var_1_6=0, var_1_7=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=-4294967287, var_1_16=-4294967287, var_1_6=0, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 73 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 324 NumberOfCodeBlocks, 324 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 544/544 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 13:12:40,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 391f5d8b898ab2981d898384ae502b469bbad72d3843c4719f1b24203d9f9914 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:12:42,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:12:42,260 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:12:42,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:12:42,266 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:12:42,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:12:42,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:12:42,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:12:42,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:12:42,293 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:12:42,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:12:42,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:12:42,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:12:42,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:12:42,295 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:12:42,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:12:42,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:12:42,295 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:12:42,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:12:42,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:12:42,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:12:42,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:12:42,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:12:42,297 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:12:42,298 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:12:42,298 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:12:42,298 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:12:42,298 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:12:42,298 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:12:42,299 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:12:42,299 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:12:42,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:12:42,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:12:42,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:12:42,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:12:42,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:12:42,300 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:12:42,301 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:12:42,301 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:12:42,301 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:12:42,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:12:42,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:12:42,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:12:42,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:12:42,302 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:12:42,302 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 391f5d8b898ab2981d898384ae502b469bbad72d3843c4719f1b24203d9f9914 [2024-10-11 13:12:42,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:12:42,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:12:42,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:12:42,584 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:12:42,584 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:12:42,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i [2024-10-11 13:12:43,928 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:12:44,116 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:12:44,117 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i [2024-10-11 13:12:44,131 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a876a0088/38fff7249b5942eaa523ebeb5012242d/FLAG8d5782a6a [2024-10-11 13:12:44,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a876a0088/38fff7249b5942eaa523ebeb5012242d [2024-10-11 13:12:44,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:12:44,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:12:44,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:12:44,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:12:44,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:12:44,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:12:44" (1/1) ... [2024-10-11 13:12:44,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c0deb2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:44, skipping insertion in model container [2024-10-11 13:12:44,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:12:44" (1/1) ... [2024-10-11 13:12:44,184 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:12:44,327 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i[913,926] [2024-10-11 13:12:44,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:12:44,397 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:12:44,409 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i[913,926] [2024-10-11 13:12:44,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:12:44,443 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:12:44,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:44 WrapperNode [2024-10-11 13:12:44,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:12:44,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:12:44,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:12:44,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:12:44,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:44" (1/1) ... [2024-10-11 13:12:44,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:44" (1/1) ... [2024-10-11 13:12:44,485 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-10-11 13:12:44,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:12:44,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:12:44,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:12:44,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:12:44,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:44" (1/1) ... [2024-10-11 13:12:44,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:44" (1/1) ... [2024-10-11 13:12:44,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:44" (1/1) ... [2024-10-11 13:12:44,520 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 13:12:44,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:44" (1/1) ... [2024-10-11 13:12:44,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:44" (1/1) ... [2024-10-11 13:12:44,540 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:44" (1/1) ... [2024-10-11 13:12:44,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:44" (1/1) ... [2024-10-11 13:12:44,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:44" (1/1) ... [2024-10-11 13:12:44,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:44" (1/1) ... [2024-10-11 13:12:44,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:12:44,556 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:12:44,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:12:44,557 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:12:44,557 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:44" (1/1) ... [2024-10-11 13:12:44,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:12:44,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:12:44,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:12:44,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:12:44,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:12:44,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:12:44,623 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:12:44,623 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:12:44,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:12:44,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:12:44,693 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:12:44,695 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:12:53,303 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 13:12:53,304 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:12:53,347 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:12:53,347 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:12:53,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:12:53 BoogieIcfgContainer [2024-10-11 13:12:53,348 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:12:53,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:12:53,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:12:53,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:12:53,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:12:44" (1/3) ... [2024-10-11 13:12:53,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4283b41a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:12:53, skipping insertion in model container [2024-10-11 13:12:53,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:44" (2/3) ... [2024-10-11 13:12:53,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4283b41a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:12:53, skipping insertion in model container [2024-10-11 13:12:53,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:12:53" (3/3) ... [2024-10-11 13:12:53,355 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-98.i [2024-10-11 13:12:53,370 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:12:53,370 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:12:53,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:12:53,456 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@48c5bf19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:12:53,456 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:12:53,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:12:53,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 13:12:53,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:12:53,492 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:12:53,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:12:53,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:12:53,500 INFO L85 PathProgramCache]: Analyzing trace with hash 651518210, now seen corresponding path program 1 times [2024-10-11 13:12:53,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:12:53,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684701034] [2024-10-11 13:12:53,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:12:53,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:12:53,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:12:53,518 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:12:53,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 13:12:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:54,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:12:54,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:12:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-11 13:12:54,080 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:12:54,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:12:54,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684701034] [2024-10-11 13:12:54,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684701034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:12:54,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:12:54,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:12:54,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597356412] [2024-10-11 13:12:54,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:12:54,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:12:54,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:12:54,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:12:54,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:12:54,107 INFO L87 Difference]: Start difference. First operand has 47 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:12:58,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:12:58,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:12:58,284 INFO L93 Difference]: Finished difference Result 91 states and 157 transitions. [2024-10-11 13:12:58,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:12:58,331 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 105 [2024-10-11 13:12:58,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:12:58,336 INFO L225 Difference]: With dead ends: 91 [2024-10-11 13:12:58,336 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 13:12:58,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:12:58,341 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:12:58,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 13:12:58,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 13:12:58,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-11 13:12:58,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:12:58,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2024-10-11 13:12:58,374 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 105 [2024-10-11 13:12:58,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:12:58,374 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 66 transitions. [2024-10-11 13:12:58,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:12:58,374 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2024-10-11 13:12:58,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 13:12:58,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:12:58,377 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:12:58,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 13:12:58,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:12:58,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:12:58,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:12:58,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1132607100, now seen corresponding path program 1 times [2024-10-11 13:12:58,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:12:58,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255423660] [2024-10-11 13:12:58,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:12:58,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:12:58,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:12:58,595 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:12:58,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 13:12:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:59,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 13:12:59,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:14:16,274 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)