./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 22d48377ba2b5807c6e679e35c40cf38e830cbb9db14f8a42a5558451489d0b8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:54:48,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:54:48,251 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:54:48,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:54:48,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:54:48,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:54:48,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:54:48,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:54:48,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:54:48,275 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:54:48,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:54:48,276 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:54:48,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:54:48,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:54:48,277 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:54:48,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:54:48,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:54:48,277 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:54:48,278 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:54:48,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:54:48,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:54:48,279 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:54:48,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:54:48,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:54:48,279 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:54:48,279 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:54:48,280 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:54:48,280 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:54:48,280 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:54:48,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:54:48,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:54:48,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:54:48,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:54:48,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:54:48,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:54:48,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:54:48,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:54:48,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:54:48,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:54:48,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:54:48,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:54:48,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:54:48,286 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/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/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 -> 22d48377ba2b5807c6e679e35c40cf38e830cbb9db14f8a42a5558451489d0b8 [2024-11-12 06:54:48,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:54:48,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:54:48,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:54:48,503 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:54:48,503 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:54:48,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.i [2024-11-12 06:54:49,718 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:54:49,867 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:54:49,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.i [2024-11-12 06:54:49,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd6f21b46/58c59efe73524af697991ab5ba7a3e05/FLAG59807f99c [2024-11-12 06:54:50,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd6f21b46/58c59efe73524af697991ab5ba7a3e05 [2024-11-12 06:54:50,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:54:50,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:54:50,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:54:50,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:54:50,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:54:50,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:54:50" (1/1) ... [2024-11-12 06:54:50,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b45dd85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:50, skipping insertion in model container [2024-11-12 06:54:50,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:54:50" (1/1) ... [2024-11-12 06:54:50,300 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:54:50,454 WARN L250 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-1.i[912,925] [2024-11-12 06:54:50,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:54:50,517 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:54:50,530 WARN L250 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-1.i[912,925] [2024-11-12 06:54:50,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:54:50,561 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:54:50,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:50 WrapperNode [2024-11-12 06:54:50,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:54:50,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:54:50,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:54:50,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:54:50,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:50" (1/1) ... [2024-11-12 06:54:50,580 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:50" (1/1) ... [2024-11-12 06:54:50,601 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-11-12 06:54:50,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:54:50,603 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:54:50,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:54:50,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:54:50,613 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:50" (1/1) ... [2024-11-12 06:54:50,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:50" (1/1) ... [2024-11-12 06:54:50,618 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:50" (1/1) ... [2024-11-12 06:54:50,635 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-11-12 06:54:50,635 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:50" (1/1) ... [2024-11-12 06:54:50,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:50" (1/1) ... [2024-11-12 06:54:50,640 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:50" (1/1) ... [2024-11-12 06:54:50,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:50" (1/1) ... [2024-11-12 06:54:50,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:50" (1/1) ... [2024-11-12 06:54:50,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:50" (1/1) ... [2024-11-12 06:54:50,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:54:50,649 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:54:50,649 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:54:50,649 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:54:50,650 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:50" (1/1) ... [2024-11-12 06:54:50,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:54:50,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:54:50,680 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 06:54:50,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 06:54:50,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:54:50,735 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:54:50,736 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:54:50,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:54:50,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:54:50,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:54:50,810 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:54:50,813 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:54:51,069 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-12 06:54:51,070 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:54:51,082 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:54:51,083 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:54:51,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:54:51 BoogieIcfgContainer [2024-11-12 06:54:51,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:54:51,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:54:51,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:54:51,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:54:51,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:54:50" (1/3) ... [2024-11-12 06:54:51,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3973ed0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:54:51, skipping insertion in model container [2024-11-12 06:54:51,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:50" (2/3) ... [2024-11-12 06:54:51,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3973ed0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:54:51, skipping insertion in model container [2024-11-12 06:54:51,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:54:51" (3/3) ... [2024-11-12 06:54:51,093 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-1.i [2024-11-12 06:54:51,107 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:54:51,108 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:54:51,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:54:51,182 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;@32e1f18b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:54:51,183 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:54:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 06:54:51,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 06:54:51,196 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:54:51,197 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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-11-12 06:54:51,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:54:51,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:54:51,204 INFO L85 PathProgramCache]: Analyzing trace with hash -357054987, now seen corresponding path program 1 times [2024-11-12 06:54:51,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:54:51,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483730008] [2024-11-12 06:54:51,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:54:51,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:54:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:51,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:54:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:51,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 06:54:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:51,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 06:54:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:51,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 06:54:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:51,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 06:54:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:51,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 06:54:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:51,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 06:54:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:51,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 06:54:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:51,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 06:54:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:51,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 06:54:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:51,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 06:54:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:51,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 06:54:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:51,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 06:54:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:51,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:54:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 06:54:51,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:54:51,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483730008] [2024-11-12 06:54:51,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483730008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:54:51,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:54:51,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:54:51,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231100850] [2024-11-12 06:54:51,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:54:51,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:54:51,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:54:51,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:54:51,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:54:51,494 INFO L87 Difference]: Start difference. First operand has 58 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-12 06:54:51,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:54:51,531 INFO L93 Difference]: Finished difference Result 109 states and 174 transitions. [2024-11-12 06:54:51,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:54:51,534 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 97 [2024-11-12 06:54:51,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:54:51,552 INFO L225 Difference]: With dead ends: 109 [2024-11-12 06:54:51,552 INFO L226 Difference]: Without dead ends: 54 [2024-11-12 06:54:51,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-11-12 06:54:51,561 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:54:51,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:54:51,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-12 06:54:51,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-12 06:54:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 06:54:51,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2024-11-12 06:54:51,602 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 76 transitions. Word has length 97 [2024-11-12 06:54:51,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:54:51,602 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 76 transitions. [2024-11-12 06:54:51,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-12 06:54:51,602 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2024-11-12 06:54:51,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 06:54:51,609 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:54:51,609 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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-11-12 06:54:51,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:54:51,610 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:54:51,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:54:51,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1946841517, now seen corresponding path program 1 times [2024-11-12 06:54:51,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:54:51,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371066219] [2024-11-12 06:54:51,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:54:51,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:54:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:54:51,724 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:54:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:54:51,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:54:51,819 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:54:51,820 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:54:51,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:54:51,825 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 06:54:51,895 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:54:51,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:54:51 BoogieIcfgContainer [2024-11-12 06:54:51,900 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:54:51,901 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:54:51,901 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:54:51,901 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:54:51,902 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:54:51" (3/4) ... [2024-11-12 06:54:51,904 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:54:51,905 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:54:51,906 INFO L158 Benchmark]: Toolchain (without parser) took 1635.59ms. Allocated memory is still 153.1MB. Free memory was 85.3MB in the beginning and 100.3MB in the end (delta: -15.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:54:51,907 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:54:51,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.63ms. Allocated memory is still 153.1MB. Free memory was 85.3MB in the beginning and 71.1MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 06:54:51,908 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.89ms. Allocated memory is still 153.1MB. Free memory was 71.1MB in the beginning and 68.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:54:51,908 INFO L158 Benchmark]: Boogie Preprocessor took 45.85ms. Allocated memory is still 153.1MB. Free memory was 68.7MB in the beginning and 66.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:54:51,909 INFO L158 Benchmark]: RCFGBuilder took 433.93ms. Allocated memory is still 153.1MB. Free memory was 66.2MB in the beginning and 116.1MB in the end (delta: -49.9MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-11-12 06:54:51,909 INFO L158 Benchmark]: TraceAbstraction took 814.07ms. Allocated memory is still 153.1MB. Free memory was 115.4MB in the beginning and 100.3MB in the end (delta: 15.0MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-11-12 06:54:51,910 INFO L158 Benchmark]: Witness Printer took 4.64ms. Allocated memory is still 153.1MB. Free memory is still 100.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:54:51,912 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.14ms. Allocated memory is still 113.2MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.63ms. Allocated memory is still 153.1MB. Free memory was 85.3MB in the beginning and 71.1MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.89ms. Allocated memory is still 153.1MB. Free memory was 71.1MB in the beginning and 68.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.85ms. Allocated memory is still 153.1MB. Free memory was 68.7MB in the beginning and 66.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 433.93ms. Allocated memory is still 153.1MB. Free memory was 66.2MB in the beginning and 116.1MB in the end (delta: -49.9MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * TraceAbstraction took 814.07ms. Allocated memory is still 153.1MB. Free memory was 115.4MB in the beginning and 100.3MB in the end (delta: 15.0MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Witness Printer took 4.64ms. Allocated memory is still 153.1MB. Free memory is still 100.3MB. 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 someBinaryFLOATComparisonOperation at line 97, overapproximation of someUnaryFLOAToperation at line 40. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 5.5; [L23] float var_1_2 = 10.375; [L24] float var_1_3 = 127.5; [L25] float var_1_4 = 256.2; [L26] unsigned char var_1_5 = 1; [L27] signed long int var_1_6 = 5; [L28] unsigned char var_1_7 = 1; [L29] signed long int var_1_10 = 32; [L30] signed long int var_1_11 = 2; [L31] unsigned long int var_1_12 = 16; [L32] unsigned char var_1_13 = 50; [L33] signed long int var_1_15 = 100000000; [L34] signed short int var_1_16 = 2; [L35] unsigned long int last_1_var_1_12 = 16; VAL [isInitial=0, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_2=83/8, var_1_3=255/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L94] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_2=83/8, var_1_3=255/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L104] RET updateLastVariables() [L105] CALL updateVariables() [L70] var_1_2 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_3=255/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_3=255/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L71] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_3=255/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L72] var_1_3 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L73] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L74] var_1_4 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=1] [L75] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=1] [L76] var_1_5 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_6=5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_6=5, var_1_7=1] [L77] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_6=5, var_1_7=1] [L78] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=1] [L78] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=1] [L79] var_1_7 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5] [L80] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5] [L81] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L81] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L82] var_1_10 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L83] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L84] CALL assume_abort_if_not(var_1_10 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L84] RET assume_abort_if_not(var_1_10 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L85] var_1_11 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L86] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L87] CALL assume_abort_if_not(var_1_11 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L87] RET assume_abort_if_not(var_1_11 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L88] var_1_13 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L89] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L90] CALL assume_abort_if_not(var_1_13 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L90] RET assume_abort_if_not(var_1_13 <= 255) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L91] CALL assume_abort_if_not(var_1_13 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L91] RET assume_abort_if_not(var_1_13 != 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-256] [L105] RET updateVariables() [L106] CALL step() [L39] COND TRUE var_1_2 <= (- var_1_3) [L40] var_1_1 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=2, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=5, var_1_7=-256] [L48] var_1_16 = var_1_13 [L49] unsigned char stepLocal_0 = var_1_7; VAL [isInitial=1, last_1_var_1_12=16, stepLocal_0=-256, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=5, var_1_7=-256] [L50] COND TRUE var_1_5 || stepLocal_0 [L51] var_1_6 = ((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=1, var_1_7=-256] [L55] signed long int stepLocal_3 = var_1_11; [L56] signed long int stepLocal_2 = var_1_16 + var_1_11; VAL [isInitial=1, last_1_var_1_12=16, stepLocal_2=1, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=1, var_1_7=-256] [L57] EXPR var_1_11 << var_1_16 VAL [isInitial=1, last_1_var_1_12=16, stepLocal_2=1, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=1, var_1_7=-256] [L57] signed long int stepLocal_1 = var_1_11 << var_1_16; [L58] COND FALSE !(stepLocal_1 != ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) VAL [isInitial=1, last_1_var_1_12=16, stepLocal_2=1, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=1, var_1_7=-256] [L67] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_12=16, stepLocal_2=1, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=1, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=1, var_1_7=-256] [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR (((var_1_2 <= (- var_1_3)) ? (var_1_1 == ((float) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5 ? (var_1_1 == ((float) var_1_4)) : (var_1_1 == ((float) var_1_4)))) && ((var_1_5 || var_1_7) ? (var_1_6 == ((signed long int) ((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))))) : (var_1_6 == ((signed long int) ((var_1_10 + var_1_11) - 4))))) && (((var_1_11 << var_1_16) != ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) ? (((var_1_16 % var_1_13) >= var_1_11) ? (((var_1_16 + var_1_11) > (last_1_var_1_12 * var_1_16)) ? (var_1_12 == ((unsigned long int) var_1_13)) : (var_1_12 == ((unsigned long int) var_1_10))) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=1, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=1, var_1_7=-256] [L97-L98] return (((((var_1_2 <= (- var_1_3)) ? (var_1_1 == ((float) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5 ? (var_1_1 == ((float) var_1_4)) : (var_1_1 == ((float) var_1_4)))) && ((var_1_5 || var_1_7) ? (var_1_6 == ((signed long int) ((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))))) : (var_1_6 == ((signed long int) ((var_1_10 + var_1_11) - 4))))) && (((var_1_11 << var_1_16) != ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) ? (((var_1_16 % var_1_13) >= var_1_11) ? (((var_1_16 + var_1_11) > (last_1_var_1_12 * var_1_16)) ? (var_1_12 == ((unsigned long int) var_1_13)) : (var_1_12 == ((unsigned long int) var_1_10))) : 1) : 1)) && (var_1_15 == ((signed long int) var_1_16))) && (var_1_16 == ((signed short int) var_1_13)) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=1, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=1, var_1_7=-256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=1, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=1, var_1_7=-256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 14, 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, 76 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 76 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred 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.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 96 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 364/364 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-11-12 06:54:51,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 22d48377ba2b5807c6e679e35c40cf38e830cbb9db14f8a42a5558451489d0b8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:54:53,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:54:53,933 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:54:53,939 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:54:53,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:54:53,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:54:53,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:54:53,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:54:53,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:54:53,973 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:54:53,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:54:53,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:54:53,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:54:53,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:54:53,976 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:54:53,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:54:53,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:54:53,977 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:54:53,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:54:53,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:54:53,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:54:53,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:54:53,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:54:53,981 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:54:53,981 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:54:53,981 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:54:53,981 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:54:53,981 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:54:53,981 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:54:53,982 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:54:53,982 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:54:53,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:54:53,982 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:54:53,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:54:53,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:54:53,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:54:53,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:54:53,983 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:54:53,983 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:54:53,983 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:54:53,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:54:53,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:54:53,987 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:54:53,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:54:53,988 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/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/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 -> 22d48377ba2b5807c6e679e35c40cf38e830cbb9db14f8a42a5558451489d0b8 [2024-11-12 06:54:54,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:54:54,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:54:54,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:54:54,305 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:54:54,306 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:54:54,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.i [2024-11-12 06:54:55,644 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:54:55,813 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:54:55,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.i [2024-11-12 06:54:55,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c44110d3/90663a7f291e4ea792ff037b98dffe18/FLAG4ad49fd2d [2024-11-12 06:54:56,204 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c44110d3/90663a7f291e4ea792ff037b98dffe18 [2024-11-12 06:54:56,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:54:56,207 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:54:56,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:54:56,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:54:56,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:54:56,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:54:56" (1/1) ... [2024-11-12 06:54:56,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7830543a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:56, skipping insertion in model container [2024-11-12 06:54:56,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:54:56" (1/1) ... [2024-11-12 06:54:56,234 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:54:56,383 WARN L250 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-1.i[912,925] [2024-11-12 06:54:56,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:54:56,451 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:54:56,463 WARN L250 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-1.i[912,925] [2024-11-12 06:54:56,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:54:56,509 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:54:56,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:56 WrapperNode [2024-11-12 06:54:56,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:54:56,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:54:56,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:54:56,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:54:56,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:56" (1/1) ... [2024-11-12 06:54:56,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:56" (1/1) ... [2024-11-12 06:54:56,557 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-11-12 06:54:56,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:54:56,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:54:56,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:54:56,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:54:56,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:56" (1/1) ... [2024-11-12 06:54:56,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:56" (1/1) ... [2024-11-12 06:54:56,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:56" (1/1) ... [2024-11-12 06:54:56,589 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-11-12 06:54:56,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:56" (1/1) ... [2024-11-12 06:54:56,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:56" (1/1) ... [2024-11-12 06:54:56,597 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:56" (1/1) ... [2024-11-12 06:54:56,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:56" (1/1) ... [2024-11-12 06:54:56,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:56" (1/1) ... [2024-11-12 06:54:56,611 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:56" (1/1) ... [2024-11-12 06:54:56,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:54:56,618 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:54:56,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:54:56,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:54:56,619 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:56" (1/1) ... [2024-11-12 06:54:56,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:54:56,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:54:56,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 06:54:56,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 06:54:56,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:54:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:54:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:54:56,689 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:54:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:54:56,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:54:56,752 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:54:56,754 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:54:57,020 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-12 06:54:57,020 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:54:57,033 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:54:57,034 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:54:57,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:54:57 BoogieIcfgContainer [2024-11-12 06:54:57,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:54:57,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:54:57,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:54:57,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:54:57,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:54:56" (1/3) ... [2024-11-12 06:54:57,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c925575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:54:57, skipping insertion in model container [2024-11-12 06:54:57,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:54:56" (2/3) ... [2024-11-12 06:54:57,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c925575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:54:57, skipping insertion in model container [2024-11-12 06:54:57,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:54:57" (3/3) ... [2024-11-12 06:54:57,042 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-1.i [2024-11-12 06:54:57,064 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:54:57,064 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:54:57,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:54:57,137 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;@43b172f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:54:57,139 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:54:57,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 06:54:57,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-12 06:54:57,151 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:54:57,152 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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-11-12 06:54:57,152 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:54:57,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:54:57,158 INFO L85 PathProgramCache]: Analyzing trace with hash 597970591, now seen corresponding path program 1 times [2024-11-12 06:54:57,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:54:57,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553747607] [2024-11-12 06:54:57,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:54:57,171 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-11-12 06:54:57,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:54:57,174 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-11-12 06:54:57,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-12 06:54:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:57,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 06:54:57,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:54:57,364 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-12 06:54:57,365 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:54:57,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:54:57,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553747607] [2024-11-12 06:54:57,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553747607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:54:57,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:54:57,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:54:57,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163103905] [2024-11-12 06:54:57,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:54:57,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:54:57,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:54:57,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:54:57,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:54:57,391 INFO L87 Difference]: Start difference. First operand has 50 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 06:54:57,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:54:57,415 INFO L93 Difference]: Finished difference Result 93 states and 152 transitions. [2024-11-12 06:54:57,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:54:57,417 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-11-12 06:54:57,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:54:57,422 INFO L225 Difference]: With dead ends: 93 [2024-11-12 06:54:57,422 INFO L226 Difference]: Without dead ends: 46 [2024-11-12 06:54:57,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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-11-12 06:54:57,427 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:54:57,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:54:57,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-12 06:54:57,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-12 06:54:57,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 06:54:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2024-11-12 06:54:57,457 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 93 [2024-11-12 06:54:57,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:54:57,457 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2024-11-12 06:54:57,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-12 06:54:57,457 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2024-11-12 06:54:57,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-12 06:54:57,460 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:54:57,460 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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-11-12 06:54:57,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-11-12 06:54:57,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-11-12 06:54:57,661 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:54:57,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:54:57,662 INFO L85 PathProgramCache]: Analyzing trace with hash 416388695, now seen corresponding path program 1 times [2024-11-12 06:54:57,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:54:57,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090273166] [2024-11-12 06:54:57,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:54:57,662 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-11-12 06:54:57,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:54:57,666 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-11-12 06:54:57,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-12 06:54:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:54:57,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 06:54:57,816 INFO L279 TraceCheckSpWp]: Computing forward predicates...