./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-75.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_loopvsstraightlinecode_50-1loop_file-75.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 0514dc120a2eec8e3826a1c886bd786bb270df55b2866cab07c1f5425958d7d2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:09:49,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:09:49,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 23:09:49,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:09:49,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:09:50,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:09:50,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:09:50,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:09:50,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:09:50,036 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:09:50,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:09:50,037 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:09:50,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:09:50,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:09:50,038 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:09:50,039 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:09:50,039 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:09:50,039 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:09:50,040 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 23:09:50,040 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:09:50,040 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:09:50,041 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:09:50,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:09:50,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:09:50,042 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:09:50,044 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:09:50,045 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:09:50,045 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:09:50,045 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:09:50,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:09:50,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:09:50,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:09:50,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:09:50,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:09:50,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:09:50,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:09:50,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 23:09:50,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 23:09:50,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:09:50,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:09:50,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:09:50,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:09:50,052 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 -> 0514dc120a2eec8e3826a1c886bd786bb270df55b2866cab07c1f5425958d7d2 [2024-11-18 23:09:50,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:09:50,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:09:50,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:09:50,334 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:09:50,334 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:09:50,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-75.i [2024-11-18 23:09:51,726 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:09:51,922 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:09:51,922 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-75.i [2024-11-18 23:09:51,930 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c65ccfa68/9883a89881a04439a7b34df69888d59b/FLAG0fd99f8e6 [2024-11-18 23:09:51,956 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c65ccfa68/9883a89881a04439a7b34df69888d59b [2024-11-18 23:09:51,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:09:51,960 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:09:51,961 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:09:51,961 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:09:51,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:09:51,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:09:51" (1/1) ... [2024-11-18 23:09:51,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@641f150e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:09:51, skipping insertion in model container [2024-11-18 23:09:51,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:09:51" (1/1) ... [2024-11-18 23:09:51,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:09:52,170 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_loopvsstraightlinecode_50-1loop_file-75.i[915,928] [2024-11-18 23:09:52,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:09:52,239 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:09:52,248 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_loopvsstraightlinecode_50-1loop_file-75.i[915,928] [2024-11-18 23:09:52,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:09:52,294 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:09:52,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:09:52 WrapperNode [2024-11-18 23:09:52,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:09:52,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:09:52,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:09:52,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:09:52,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:09:52" (1/1) ... [2024-11-18 23:09:52,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:09:52" (1/1) ... [2024-11-18 23:09:52,340 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-11-18 23:09:52,341 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:09:52,341 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:09:52,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:09:52,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:09:52,354 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:09:52" (1/1) ... [2024-11-18 23:09:52,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:09:52" (1/1) ... [2024-11-18 23:09:52,357 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:09:52" (1/1) ... [2024-11-18 23:09:52,372 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-18 23:09:52,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:09:52" (1/1) ... [2024-11-18 23:09:52,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:09:52" (1/1) ... [2024-11-18 23:09:52,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:09:52" (1/1) ... [2024-11-18 23:09:52,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:09:52" (1/1) ... [2024-11-18 23:09:52,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:09:52" (1/1) ... [2024-11-18 23:09:52,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:09:52" (1/1) ... [2024-11-18 23:09:52,405 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:09:52,406 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:09:52,406 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:09:52,406 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:09:52,409 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:09:52" (1/1) ... [2024-11-18 23:09:52,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:09:52,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:09:52,449 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-18 23:09:52,452 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-18 23:09:52,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:09:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:09:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:09:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 23:09:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:09:52,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:09:52,626 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:09:52,628 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:09:53,009 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-18 23:09:53,009 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:09:53,025 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:09:53,025 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:09:53,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:09:53 BoogieIcfgContainer [2024-11-18 23:09:53,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:09:53,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:09:53,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:09:53,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:09:53,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:09:51" (1/3) ... [2024-11-18 23:09:53,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb60054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:09:53, skipping insertion in model container [2024-11-18 23:09:53,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:09:52" (2/3) ... [2024-11-18 23:09:53,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb60054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:09:53, skipping insertion in model container [2024-11-18 23:09:53,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:09:53" (3/3) ... [2024-11-18 23:09:53,036 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-75.i [2024-11-18 23:09:53,053 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:09:53,054 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:09:53,130 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:09:53,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;@356ce350, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:09:53,138 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:09:53,142 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-18 23:09:53,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-18 23:09:53,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:09:53,159 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:09:53,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:09:53,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:09:53,166 INFO L85 PathProgramCache]: Analyzing trace with hash -372112586, now seen corresponding path program 1 times [2024-11-18 23:09:53,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:09:53,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284528393] [2024-11-18 23:09:53,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:09:53,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:09:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:09:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-18 23:09:53,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:09:53,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284528393] [2024-11-18 23:09:53,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284528393] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:09:53,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189868641] [2024-11-18 23:09:53,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:09:53,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:09:53,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:09:53,483 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 23:09:53,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 23:09:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:09:53,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 23:09:53,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:09:53,759 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-18 23:09:53,760 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:09:53,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189868641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:09:53,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 23:09:53,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 23:09:53,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934779064] [2024-11-18 23:09:53,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:09:53,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 23:09:53,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:09:53,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 23:09:53,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:09:53,791 INFO L87 Difference]: Start difference. First operand has 83 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-18 23:09:53,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:09:53,816 INFO L93 Difference]: Finished difference Result 163 states and 264 transitions. [2024-11-18 23:09:53,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 23:09:53,818 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 130 [2024-11-18 23:09:53,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:09:53,824 INFO L225 Difference]: With dead ends: 163 [2024-11-18 23:09:53,824 INFO L226 Difference]: Without dead ends: 79 [2024-11-18 23:09:53,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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-18 23:09:53,829 INFO L432 NwaCegarLoop]: 120 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, 120 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-18 23:09:53,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:09:53,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-18 23:09:53,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-18 23:09:53,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-18 23:09:53,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 116 transitions. [2024-11-18 23:09:53,874 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 116 transitions. Word has length 130 [2024-11-18 23:09:53,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:09:53,877 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 116 transitions. [2024-11-18 23:09:53,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-18 23:09:53,878 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 116 transitions. [2024-11-18 23:09:53,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-18 23:09:53,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:09:53,881 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:09:53,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 23:09:54,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 23:09:54,083 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:09:54,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:09:54,084 INFO L85 PathProgramCache]: Analyzing trace with hash -322103952, now seen corresponding path program 1 times [2024-11-18 23:09:54,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:09:54,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769362313] [2024-11-18 23:09:54,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:09:54,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:09:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:09:54,640 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-18 23:09:54,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:09:54,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769362313] [2024-11-18 23:09:54,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769362313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:09:54,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:09:54,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 23:09:54,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575432954] [2024-11-18 23:09:54,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:09:54,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 23:09:54,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:09:54,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 23:09:54,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:09:54,645 INFO L87 Difference]: Start difference. First operand 79 states and 116 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-18 23:09:54,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:09:54,722 INFO L93 Difference]: Finished difference Result 156 states and 231 transitions. [2024-11-18 23:09:54,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 23:09:54,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 131 [2024-11-18 23:09:54,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:09:54,728 INFO L225 Difference]: With dead ends: 156 [2024-11-18 23:09:54,728 INFO L226 Difference]: Without dead ends: 80 [2024-11-18 23:09:54,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:09:54,730 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 23:09:54,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 23:09:54,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-18 23:09:54,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-18 23:09:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 59 states have internal predecessors, (79), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-18 23:09:54,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 117 transitions. [2024-11-18 23:09:54,743 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 117 transitions. Word has length 131 [2024-11-18 23:09:54,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:09:54,744 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 117 transitions. [2024-11-18 23:09:54,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-18 23:09:54,745 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 117 transitions. [2024-11-18 23:09:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-18 23:09:54,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:09:54,747 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:09:54,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 23:09:54,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:09:54,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:09:54,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2013515454, now seen corresponding path program 1 times [2024-11-18 23:09:54,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:09:54,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996268099] [2024-11-18 23:09:54,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:09:54,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:09:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:09:55,183 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-18 23:09:55,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:09:55,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996268099] [2024-11-18 23:09:55,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996268099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:09:55,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678197035] [2024-11-18 23:09:55,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:09:55,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:09:55,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:09:55,190 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 23:09:55,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 23:09:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:09:55,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 23:09:55,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:09:55,432 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 228 proven. 9 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-11-18 23:09:55,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:09:55,601 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-18 23:09:55,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678197035] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 23:09:55,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 23:09:55,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-18 23:09:55,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434336590] [2024-11-18 23:09:55,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 23:09:55,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-18 23:09:55,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:09:55,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-18 23:09:55,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-18 23:09:55,605 INFO L87 Difference]: Start difference. First operand 80 states and 117 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-18 23:09:56,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:09:56,216 INFO L93 Difference]: Finished difference Result 208 states and 299 transitions. [2024-11-18 23:09:56,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-18 23:09:56,217 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 132 [2024-11-18 23:09:56,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:09:56,219 INFO L225 Difference]: With dead ends: 208 [2024-11-18 23:09:56,219 INFO L226 Difference]: Without dead ends: 131 [2024-11-18 23:09:56,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-18 23:09:56,222 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 271 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 23:09:56,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 245 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 23:09:56,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-18 23:09:56,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 83. [2024-11-18 23:09:56,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-18 23:09:56,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. [2024-11-18 23:09:56,238 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 111 transitions. Word has length 132 [2024-11-18 23:09:56,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:09:56,239 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 111 transitions. [2024-11-18 23:09:56,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-18 23:09:56,239 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 111 transitions. [2024-11-18 23:09:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-18 23:09:56,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:09:56,242 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:09:56,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-18 23:09:56,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-18 23:09:56,443 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:09:56,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:09:56,444 INFO L85 PathProgramCache]: Analyzing trace with hash -144299699, now seen corresponding path program 1 times [2024-11-18 23:09:56,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:09:56,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453021253] [2024-11-18 23:09:56,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:09:56,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:09:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:09:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-18 23:09:56,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:09:56,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453021253] [2024-11-18 23:09:56,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453021253] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:09:56,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700259809] [2024-11-18 23:09:56,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:09:56,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:09:56,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:09:56,839 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 23:09:56,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 23:09:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:09:57,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-18 23:09:57,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:09:57,199 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 228 proven. 9 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-11-18 23:09:57,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:09:57,483 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 45 proven. 9 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-18 23:09:57,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700259809] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 23:09:57,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 23:09:57,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 15 [2024-11-18 23:09:57,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384035142] [2024-11-18 23:09:57,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 23:09:57,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-18 23:09:57,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:09:57,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-18 23:09:57,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-18 23:09:57,489 INFO L87 Difference]: Start difference. First operand 83 states and 111 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-18 23:09:58,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:09:58,216 INFO L93 Difference]: Finished difference Result 211 states and 285 transitions. [2024-11-18 23:09:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-18 23:09:58,216 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 133 [2024-11-18 23:09:58,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:09:58,218 INFO L225 Difference]: With dead ends: 211 [2024-11-18 23:09:58,219 INFO L226 Difference]: Without dead ends: 131 [2024-11-18 23:09:58,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2024-11-18 23:09:58,220 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 265 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 23:09:58,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 531 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 23:09:58,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-18 23:09:58,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 83. [2024-11-18 23:09:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-18 23:09:58,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 110 transitions. [2024-11-18 23:09:58,239 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 110 transitions. Word has length 133 [2024-11-18 23:09:58,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:09:58,239 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 110 transitions. [2024-11-18 23:09:58,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-18 23:09:58,240 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 110 transitions. [2024-11-18 23:09:58,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-18 23:09:58,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:09:58,246 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 23:09:58,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 23:09:58,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:09:58,447 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:09:58,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:09:58,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1097088406, now seen corresponding path program 1 times [2024-11-18 23:09:58,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:09:58,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248449398] [2024-11-18 23:09:58,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:09:58,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:09:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:09:58,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 23:09:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:09:58,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 23:09:58,591 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 23:09:58,592 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 23:09:58,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 23:09:58,596 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-18 23:09:58,690 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 23:09:58,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:09:58 BoogieIcfgContainer [2024-11-18 23:09:58,693 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 23:09:58,693 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 23:09:58,693 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 23:09:58,693 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 23:09:58,694 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:09:53" (3/4) ... [2024-11-18 23:09:58,696 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 23:09:58,697 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 23:09:58,698 INFO L158 Benchmark]: Toolchain (without parser) took 6738.10ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 164.0MB in the beginning and 65.9MB in the end (delta: 98.0MB). Peak memory consumption was 138.5MB. Max. memory is 16.1GB. [2024-11-18 23:09:58,698 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 138.4MB. Free memory is still 101.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:09:58,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.48ms. Allocated memory is still 192.9MB. Free memory was 163.8MB in the beginning and 152.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-18 23:09:58,699 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.79ms. Allocated memory is still 192.9MB. Free memory was 152.1MB in the beginning and 149.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 23:09:58,699 INFO L158 Benchmark]: Boogie Preprocessor took 63.45ms. Allocated memory is still 192.9MB. Free memory was 148.7MB in the beginning and 145.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 23:09:58,699 INFO L158 Benchmark]: RCFGBuilder took 620.11ms. Allocated memory is still 192.9MB. Free memory was 145.8MB in the beginning and 124.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-18 23:09:58,700 INFO L158 Benchmark]: TraceAbstraction took 5664.15ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 124.4MB in the beginning and 65.9MB in the end (delta: 58.5MB). Peak memory consumption was 100.4MB. Max. memory is 16.1GB. [2024-11-18 23:09:58,700 INFO L158 Benchmark]: Witness Printer took 4.16ms. Allocated memory is still 232.8MB. Free memory is still 65.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:09:58,701 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.41ms. Allocated memory is still 138.4MB. Free memory is still 101.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.48ms. Allocated memory is still 192.9MB. Free memory was 163.8MB in the beginning and 152.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.79ms. Allocated memory is still 192.9MB. Free memory was 152.1MB in the beginning and 149.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.45ms. Allocated memory is still 192.9MB. Free memory was 148.7MB in the beginning and 145.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 620.11ms. Allocated memory is still 192.9MB. Free memory was 145.8MB in the beginning and 124.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5664.15ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 124.4MB in the beginning and 65.9MB in the end (delta: 58.5MB). Peak memory consumption was 100.4MB. Max. memory is 16.1GB. * Witness Printer took 4.16ms. Allocated memory is still 232.8MB. Free memory is still 65.9MB. 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 124, overapproximation of bitwiseOr at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryArithmeticFLOAToperation at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 63.6; [L23] float var_1_4 = 128.75; [L24] float var_1_5 = 25.125; [L25] float var_1_6 = 1000000.75; [L26] unsigned char var_1_7 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 0; [L30] unsigned char var_1_14 = 0; [L31] float var_1_15 = 25.75; [L32] double var_1_16 = 0.4; [L33] double var_1_17 = 0.0; [L34] double var_1_18 = 0.0; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 24.8; [L37] signed char var_1_21 = 1; [L38] double var_1_22 = 200.8; [L39] unsigned short int var_1_23 = 40076; [L40] unsigned short int var_1_24 = 8; [L41] unsigned long int var_1_25 = 2; [L42] double last_1_var_1_22 = 200.8; VAL [isInitial=0, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_4=515/4, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L128] isInitial = 1 [L129] FCALL initially() [L130] int k_loop; [L131] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_4=515/4, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L131] COND TRUE k_loop < 1 [L132] CALL updateLastVariables() [L121] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_4=515/4, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L132] RET updateLastVariables() [L133] CALL updateVariables() [L87] var_1_4 = __VERIFIER_nondet_float() [L88] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L88] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L89] var_1_5 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_6=4000003/4, var_1_7=1] [L90] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_6=4000003/4, var_1_7=1] [L91] var_1_6 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L92] RET assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L93] var_1_11 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L94] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L95] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L95] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L96] var_1_12 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L97] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L98] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L98] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L99] var_1_13 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L100] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L101] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L101] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L102] var_1_14 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L103] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L104] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L104] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L105] var_1_17 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L106] RET assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L107] var_1_18 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L108] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L109] var_1_19 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L110] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L111] var_1_20 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L112] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_7=1] [L113] var_1_23 = __VERIFIER_nondet_ushort() [L114] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_7=1] [L114] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_7=1] [L115] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_7=1] [L115] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_7=1] [L116] var_1_24 = __VERIFIER_nondet_ushort() [L117] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_7=1] [L117] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_7=1] [L118] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_7=1] [L118] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_7=1] [L133] RET updateVariables() [L134] CALL step() [L46] COND TRUE ! (var_1_4 < 16.8f) [L47] var_1_15 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_6=1000000000005, var_1_7=1] [L49] var_1_25 = var_1_23 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L50] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L50] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L50] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L50] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L50] COND TRUE (((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25 [L51] var_1_7 = ((var_1_11 && var_1_12) && var_1_13) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L59] COND FALSE !(var_1_25 > var_1_25) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L62] COND TRUE var_1_18 > (var_1_20 + (var_1_19 * var_1_17)) [L63] var_1_16 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L68] unsigned long int stepLocal_1 = var_1_25; VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L69] COND FALSE !(var_1_18 < (last_1_var_1_22 * var_1_4)) [L76] var_1_22 = var_1_20 VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_1=318/5, var_1_20=1000000000006, var_1_21=1, var_1_22=1000000000006, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L78] unsigned char stepLocal_0 = -1 <= var_1_25; VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_0=0, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_1=318/5, var_1_20=1000000000006, var_1_21=1, var_1_22=1000000000006, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L79] COND TRUE stepLocal_0 || var_1_7 [L80] var_1_1 = (var_1_4 + (var_1_5 + var_1_6)) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_20=1000000000006, var_1_21=1, var_1_22=1000000000006, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L82] COND TRUE (- (var_1_17 + var_1_1)) >= var_1_16 [L83] var_1_21 = ((((-50) < 0 ) ? -(-50) : (-50))) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_20=1000000000006, var_1_21=50, var_1_22=1000000000006, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L134] RET step() [L135] CALL, EXPR property() [L124] EXPR (((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13)))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_20=1000000000006, var_1_21=50, var_1_22=1000000000006, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L124-L125] return ((((((((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13))))) && ((! (var_1_4 < 16.8f)) ? (var_1_15 == ((float) var_1_6)) : 1)) && ((var_1_25 > var_1_25) ? (var_1_16 == ((double) ((((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_19) - var_1_20))) : ((var_1_18 > (var_1_20 + (var_1_19 * var_1_17))) ? (var_1_16 == ((double) var_1_6)) : (var_1_16 == ((double) var_1_20))))) && (((- (var_1_17 + var_1_1)) >= var_1_16) ? (var_1_21 == ((signed char) ((((-50) < 0 ) ? -(-50) : (-50))))) : 1)) && ((var_1_18 < (last_1_var_1_22 * var_1_4)) ? (((var_1_23 - var_1_24) < var_1_25) ? (var_1_22 == ((double) var_1_5)) : (var_1_22 == ((double) var_1_17))) : (var_1_22 == ((double) var_1_20)))) && (var_1_25 == ((unsigned long int) var_1_23)) ; [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_20=1000000000006, var_1_21=50, var_1_22=1000000000006, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1000000000005, var_1_16=1000000000005, var_1_20=1000000000006, var_1_21=50, var_1_22=1000000000006, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_6=1000000000005, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 5, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 554 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 536 mSDsluCounter, 1093 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 658 mSDsCounter, 254 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 976 IncrementalHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 254 mSolverCounterUnsat, 435 mSDtfsCounter, 976 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 702 GetRequests, 657 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=0, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 96 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1058 NumberOfCodeBlocks, 1058 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1177 ConstructedInterpolants, 0 QuantifiedInterpolants, 1748 SizeOfPredicates, 3 NumberOfNonLiveVariables, 905 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 6066/6156 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-18 23:09:58,732 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_loopvsstraightlinecode_50-1loop_file-75.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 0514dc120a2eec8e3826a1c886bd786bb270df55b2866cab07c1f5425958d7d2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:10:00,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:10:00,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 23:10:00,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:10:00,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:10:01,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:10:01,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:10:01,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:10:01,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:10:01,024 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:10:01,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:10:01,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:10:01,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:10:01,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:10:01,027 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:10:01,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:10:01,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:10:01,028 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:10:01,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:10:01,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:10:01,029 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:10:01,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:10:01,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:10:01,030 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 23:10:01,031 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 23:10:01,031 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:10:01,031 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 23:10:01,032 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:10:01,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:10:01,032 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:10:01,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:10:01,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:10:01,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:10:01,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:10:01,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:10:01,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:10:01,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:10:01,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:10:01,035 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 23:10:01,035 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 23:10:01,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:10:01,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:10:01,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:10:01,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:10:01,036 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 -> 0514dc120a2eec8e3826a1c886bd786bb270df55b2866cab07c1f5425958d7d2 [2024-11-18 23:10:01,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:10:01,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:10:01,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:10:01,388 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:10:01,388 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:10:01,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-75.i [2024-11-18 23:10:03,014 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:10:03,262 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:10:03,263 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-75.i [2024-11-18 23:10:03,276 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac4bbeb3a/5108ac7be793477db0f5e8737e457acb/FLAGfe8672bf9 [2024-11-18 23:10:03,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac4bbeb3a/5108ac7be793477db0f5e8737e457acb [2024-11-18 23:10:03,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:10:03,578 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:10:03,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:10:03,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:10:03,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:10:03,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:10:03" (1/1) ... [2024-11-18 23:10:03,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ee4a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:03, skipping insertion in model container [2024-11-18 23:10:03,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:10:03" (1/1) ... [2024-11-18 23:10:03,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:10:03,804 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_loopvsstraightlinecode_50-1loop_file-75.i[915,928] [2024-11-18 23:10:03,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:10:03,907 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:10:03,921 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_loopvsstraightlinecode_50-1loop_file-75.i[915,928] [2024-11-18 23:10:03,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:10:03,983 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:10:03,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:03 WrapperNode [2024-11-18 23:10:03,984 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:10:03,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:10:03,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:10:03,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:10:03,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:03" (1/1) ... [2024-11-18 23:10:04,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:03" (1/1) ... [2024-11-18 23:10:04,040 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2024-11-18 23:10:04,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:10:04,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:10:04,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:10:04,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:10:04,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:03" (1/1) ... [2024-11-18 23:10:04,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:03" (1/1) ... [2024-11-18 23:10:04,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:03" (1/1) ... [2024-11-18 23:10:04,078 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-18 23:10:04,079 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:03" (1/1) ... [2024-11-18 23:10:04,079 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:03" (1/1) ... [2024-11-18 23:10:04,089 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:03" (1/1) ... [2024-11-18 23:10:04,096 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:03" (1/1) ... [2024-11-18 23:10:04,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:03" (1/1) ... [2024-11-18 23:10:04,104 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:03" (1/1) ... [2024-11-18 23:10:04,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:10:04,116 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:10:04,116 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:10:04,116 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:10:04,117 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:03" (1/1) ... [2024-11-18 23:10:04,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:10:04,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:10:04,151 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-18 23:10:04,154 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-18 23:10:04,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:10:04,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 23:10:04,198 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:10:04,198 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:10:04,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:10:04,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:10:04,274 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:10:04,276 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:10:23,036 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-18 23:10:23,037 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:10:23,050 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:10:23,050 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:10:23,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:10:23 BoogieIcfgContainer [2024-11-18 23:10:23,051 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:10:23,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:10:23,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:10:23,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:10:23,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:10:03" (1/3) ... [2024-11-18 23:10:23,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d28acb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:10:23, skipping insertion in model container [2024-11-18 23:10:23,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:03" (2/3) ... [2024-11-18 23:10:23,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d28acb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:10:23, skipping insertion in model container [2024-11-18 23:10:23,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:10:23" (3/3) ... [2024-11-18 23:10:23,059 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-75.i [2024-11-18 23:10:23,076 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:10:23,076 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:10:23,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:10:23,154 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;@2495f55e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:10:23,155 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:10:23,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-18 23:10:23,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-18 23:10:23,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:10:23,177 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:10:23,177 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:10:23,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:10:23,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1742260396, now seen corresponding path program 1 times [2024-11-18 23:10:23,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:10:23,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110248547] [2024-11-18 23:10:23,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:10:23,205 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-18 23:10:23,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:10:23,209 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-18 23:10:23,210 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-18 23:10:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:10:23,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 23:10:23,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:10:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-11-18 23:10:23,930 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:10:23,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 23:10:23,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [110248547] [2024-11-18 23:10:23,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [110248547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:10:23,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:10:23,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 23:10:23,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219617442] [2024-11-18 23:10:23,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:10:23,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 23:10:23,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 23:10:23,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 23:10:23,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:10:23,966 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-18 23:10:23,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:10:23,996 INFO L93 Difference]: Finished difference Result 125 states and 204 transitions. [2024-11-18 23:10:23,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 23:10:23,999 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2024-11-18 23:10:24,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:10:24,008 INFO L225 Difference]: With dead ends: 125 [2024-11-18 23:10:24,008 INFO L226 Difference]: Without dead ends: 60 [2024-11-18 23:10:24,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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-18 23:10:24,018 INFO L432 NwaCegarLoop]: 90 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, 90 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-18 23:10:24,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:10:24,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-18 23:10:24,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-18 23:10:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-18 23:10:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 86 transitions. [2024-11-18 23:10:24,063 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 86 transitions. Word has length 126 [2024-11-18 23:10:24,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:10:24,064 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 86 transitions. [2024-11-18 23:10:24,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-18 23:10:24,064 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 86 transitions. [2024-11-18 23:10:24,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-18 23:10:24,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:10:24,067 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:10:24,085 INFO L552 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)] Ended with exit code 0 [2024-11-18 23:10:24,268 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-18 23:10:24,268 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:10:24,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:10:24,269 INFO L85 PathProgramCache]: Analyzing trace with hash 967068361, now seen corresponding path program 1 times [2024-11-18 23:10:24,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:10:24,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590710043] [2024-11-18 23:10:24,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:10:24,270 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-18 23:10:24,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:10:24,273 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-18 23:10:24,293 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-18 23:10:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:10:25,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-18 23:10:25,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:10:39,851 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-18 23:10:47,976 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-18 23:10:56,062 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-18 23:11:04,197 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-18 23:11:12,333 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-18 23:11:20,476 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)