./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-97.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 0bd598c6ab4eb0f85d075cd68c94871d585d0d9cc55a581ea912a4da97c7f3b7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:05:50,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:05:50,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:05:50,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:05:50,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:05:50,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:05:50,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:05:50,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:05:50,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:05:50,388 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:05:50,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:05:50,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:05:50,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:05:50,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:05:50,390 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:05:50,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:05:50,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:05:50,390 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:05:50,391 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:05:50,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:05:50,391 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:05:50,394 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:05:50,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:05:50,395 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:05:50,395 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:05:50,395 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:05:50,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:05:50,395 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:05:50,396 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:05:50,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:05:50,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:05:50,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:05:50,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:05:50,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:05:50,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:05:50,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:05:50,398 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:05:50,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:05:50,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:05:50,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:05:50,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:05:50,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:05:50,399 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 -> 0bd598c6ab4eb0f85d075cd68c94871d585d0d9cc55a581ea912a4da97c7f3b7 [2024-11-12 05:05:50,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:05:50,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:05:50,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:05:50,611 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:05:50,612 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:05:50,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-97.i [2024-11-12 05:05:51,833 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:05:52,012 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:05:52,013 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-97.i [2024-11-12 05:05:52,021 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e522dbf58/60a1b8290bbd4d8eacbd70eca94353d9/FLAG4d67ed88f [2024-11-12 05:05:52,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e522dbf58/60a1b8290bbd4d8eacbd70eca94353d9 [2024-11-12 05:05:52,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:05:52,035 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:05:52,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:05:52,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:05:52,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:05:52,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:05:52" (1/1) ... [2024-11-12 05:05:52,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b7bdda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:05:52, skipping insertion in model container [2024-11-12 05:05:52,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:05:52" (1/1) ... [2024-11-12 05:05:52,083 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:05:52,230 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_100-1loop_file-97.i[916,929] [2024-11-12 05:05:52,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:05:52,320 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:05:52,331 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_100-1loop_file-97.i[916,929] [2024-11-12 05:05:52,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:05:52,376 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:05:52,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:05:52 WrapperNode [2024-11-12 05:05:52,377 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:05:52,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:05:52,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:05:52,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:05:52,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:05:52" (1/1) ... [2024-11-12 05:05:52,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:05:52" (1/1) ... [2024-11-12 05:05:52,431 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2024-11-12 05:05:52,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:05:52,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:05:52,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:05:52,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:05:52,441 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:05:52" (1/1) ... [2024-11-12 05:05:52,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:05:52" (1/1) ... [2024-11-12 05:05:52,444 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:05:52" (1/1) ... [2024-11-12 05:05:52,458 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:05:52,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:05:52" (1/1) ... [2024-11-12 05:05:52,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:05:52" (1/1) ... [2024-11-12 05:05:52,472 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:05:52" (1/1) ... [2024-11-12 05:05:52,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:05:52" (1/1) ... [2024-11-12 05:05:52,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:05:52" (1/1) ... [2024-11-12 05:05:52,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:05:52" (1/1) ... [2024-11-12 05:05:52,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:05:52,493 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:05:52,493 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:05:52,493 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:05:52,494 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:05:52" (1/1) ... [2024-11-12 05:05:52,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:05:52,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:05:52,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:05:52,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:05:52,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:05:52,563 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:05:52,563 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:05:52,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:05:52,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:05:52,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:05:52,637 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:05:52,639 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:05:52,927 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-12 05:05:52,927 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:05:52,938 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:05:52,938 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:05:52,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:05:52 BoogieIcfgContainer [2024-11-12 05:05:52,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:05:52,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:05:52,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:05:52,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:05:52,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:05:52" (1/3) ... [2024-11-12 05:05:52,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1788a740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:05:52, skipping insertion in model container [2024-11-12 05:05:52,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:05:52" (2/3) ... [2024-11-12 05:05:52,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1788a740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:05:52, skipping insertion in model container [2024-11-12 05:05:52,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:05:52" (3/3) ... [2024-11-12 05:05:52,944 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-97.i [2024-11-12 05:05:52,955 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:05:52,955 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:05:53,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:05:53,008 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;@45fa6fd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:05:53,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:05:53,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 05:05:53,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-12 05:05:53,021 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:05:53,022 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:05:53,023 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:05:53,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:05:53,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1945232597, now seen corresponding path program 1 times [2024-11-12 05:05:53,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:05:53,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979130836] [2024-11-12 05:05:53,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:05:53,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:05:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:05:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:05:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:05:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:05:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:05:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:05:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:05:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:05:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:05:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:05:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:05:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:05:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:05:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:05:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:05:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:05:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:05:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 05:05:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 05:05:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 05:05:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 05:05:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 05:05:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 05:05:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 05:05:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 05:05:53,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:05:53,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979130836] [2024-11-12 05:05:53,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979130836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:05:53,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:05:53,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:05:53,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598687215] [2024-11-12 05:05:53,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:05:53,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:05:53,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:05:53,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:05:53,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:05:53,480 INFO L87 Difference]: Start difference. First operand has 82 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 05:05:53,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:05:53,506 INFO L93 Difference]: Finished difference Result 161 states and 277 transitions. [2024-11-12 05:05:53,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:05:53,508 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 159 [2024-11-12 05:05:53,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:05:53,513 INFO L225 Difference]: With dead ends: 161 [2024-11-12 05:05:53,513 INFO L226 Difference]: Without dead ends: 78 [2024-11-12 05:05:53,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:05:53,518 INFO L435 NwaCegarLoop]: 125 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, 125 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:05:53,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:05:53,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-12 05:05:53,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-12 05:05:53,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 05:05:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 121 transitions. [2024-11-12 05:05:53,548 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 121 transitions. Word has length 159 [2024-11-12 05:05:53,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:05:53,549 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 121 transitions. [2024-11-12 05:05:53,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 05:05:53,549 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 121 transitions. [2024-11-12 05:05:53,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-12 05:05:53,553 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:05:53,554 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:05:53,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:05:53,554 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:05:53,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:05:53,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1598926285, now seen corresponding path program 1 times [2024-11-12 05:05:53,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:05:53,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766409171] [2024-11-12 05:05:53,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:05:53,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:05:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:05:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:05:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:05:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:05:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:05:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:05:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:05:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:05:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:05:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:05:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:05:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:05:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:05:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:05:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:05:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:05:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:05:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 05:05:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 05:05:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 05:05:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 05:05:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 05:05:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 05:05:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 05:05:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:53,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 05:05:53,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:05:53,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766409171] [2024-11-12 05:05:53,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766409171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:05:53,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:05:53,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:05:53,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152442723] [2024-11-12 05:05:53,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:05:53,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:05:53,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:05:53,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:05:53,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:05:53,794 INFO L87 Difference]: Start difference. First operand 78 states and 121 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 05:05:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:05:53,867 INFO L93 Difference]: Finished difference Result 219 states and 341 transitions. [2024-11-12 05:05:53,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:05:53,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2024-11-12 05:05:53,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:05:53,870 INFO L225 Difference]: With dead ends: 219 [2024-11-12 05:05:53,870 INFO L226 Difference]: Without dead ends: 144 [2024-11-12 05:05:53,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-12 05:05:53,872 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 97 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:05:53,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 302 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:05:53,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-12 05:05:53,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 88. [2024-11-12 05:05:53,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.435483870967742) internal successors, (89), 62 states have internal predecessors, (89), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 05:05:53,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 137 transitions. [2024-11-12 05:05:53,887 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 137 transitions. Word has length 159 [2024-11-12 05:05:53,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:05:53,889 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 137 transitions. [2024-11-12 05:05:53,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 05:05:53,889 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 137 transitions. [2024-11-12 05:05:53,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-12 05:05:53,891 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:05:53,891 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:05:53,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:05:53,891 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:05:53,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:05:53,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1349575615, now seen corresponding path program 1 times [2024-11-12 05:05:53,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:05:53,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873014736] [2024-11-12 05:05:53,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:05:53,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:05:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 05:05:54,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [783003328] [2024-11-12 05:05:54,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:05:54,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:05:54,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:05:54,156 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-12 05:05:54,157 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-12 05:05:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:54,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 05:05:54,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:05:55,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 474 proven. 189 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-11-12 05:05:55,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:05:56,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:05:56,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873014736] [2024-11-12 05:05:56,818 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 05:05:56,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783003328] [2024-11-12 05:05:56,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783003328] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:05:56,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 05:05:56,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2024-11-12 05:05:56,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676628889] [2024-11-12 05:05:56,819 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 05:05:56,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 05:05:56,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:05:56,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 05:05:56,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2024-11-12 05:05:56,821 INFO L87 Difference]: Start difference. First operand 88 states and 137 transitions. Second operand has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 5 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2024-11-12 05:05:58,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:05:58,056 INFO L93 Difference]: Finished difference Result 359 states and 509 transitions. [2024-11-12 05:05:58,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-12 05:05:58,057 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 5 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) Word has length 159 [2024-11-12 05:05:58,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:05:58,060 INFO L225 Difference]: With dead ends: 359 [2024-11-12 05:05:58,060 INFO L226 Difference]: Without dead ends: 274 [2024-11-12 05:05:58,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1125, Invalid=3297, Unknown=0, NotChecked=0, Total=4422 [2024-11-12 05:05:58,063 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 524 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 05:05:58,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 482 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 05:05:58,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-12 05:05:58,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 120. [2024-11-12 05:05:58,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 89 states have (on average 1.3707865168539326) internal successors, (122), 89 states have internal predecessors, (122), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 05:05:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 170 transitions. [2024-11-12 05:05:58,078 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 170 transitions. Word has length 159 [2024-11-12 05:05:58,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:05:58,079 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 170 transitions. [2024-11-12 05:05:58,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 states have internal predecessors, (60), 5 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2024-11-12 05:05:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 170 transitions. [2024-11-12 05:05:58,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 05:05:58,081 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:05:58,081 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:05:58,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 05:05:58,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:05:58,287 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:05:58,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:05:58,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1462230730, now seen corresponding path program 1 times [2024-11-12 05:05:58,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:05:58,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877035543] [2024-11-12 05:05:58,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:05:58,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:05:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:05:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:05:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:05:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:05:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:05:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:05:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:05:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:05:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:05:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:05:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:05:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:05:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:05:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:05:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:05:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:05:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:05:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 05:05:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 05:05:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 05:05:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 05:05:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 05:05:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 05:05:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 05:05:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 05:05:58,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:05:58,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877035543] [2024-11-12 05:05:58,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877035543] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:05:58,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077902962] [2024-11-12 05:05:58,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:05:58,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:05:58,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:05:58,752 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-12 05:05:58,754 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-12 05:05:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:05:58,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 05:05:58,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:05:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 365 proven. 12 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2024-11-12 05:05:59,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:05:59,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 05:05:59,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077902962] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:05:59,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 05:05:59,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 10 [2024-11-12 05:05:59,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018115424] [2024-11-12 05:05:59,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 05:05:59,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 05:05:59,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:05:59,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 05:05:59,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-12 05:05:59,200 INFO L87 Difference]: Start difference. First operand 120 states and 170 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-12 05:05:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:05:59,584 INFO L93 Difference]: Finished difference Result 314 states and 423 transitions. [2024-11-12 05:05:59,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 05:05:59,585 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 160 [2024-11-12 05:05:59,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:05:59,587 INFO L225 Difference]: With dead ends: 314 [2024-11-12 05:05:59,587 INFO L226 Difference]: Without dead ends: 197 [2024-11-12 05:05:59,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2024-11-12 05:05:59,588 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 157 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 05:05:59,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 439 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 05:05:59,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-12 05:05:59,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 108. [2024-11-12 05:05:59,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 76 states have (on average 1.263157894736842) internal successors, (96), 76 states have internal predecessors, (96), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 05:05:59,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 144 transitions. [2024-11-12 05:05:59,601 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 144 transitions. Word has length 160 [2024-11-12 05:05:59,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:05:59,601 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 144 transitions. [2024-11-12 05:05:59,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-12 05:05:59,602 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 144 transitions. [2024-11-12 05:05:59,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 05:05:59,603 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:05:59,603 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:05:59,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 05:05:59,803 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,SelfDestructingSolverStorable3 [2024-11-12 05:05:59,804 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:05:59,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:05:59,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1711581400, now seen corresponding path program 1 times [2024-11-12 05:05:59,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:05:59,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886028123] [2024-11-12 05:05:59,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:05:59,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:05:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 05:05:59,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1856798981] [2024-11-12 05:05:59,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:05:59,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:05:59,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:05:59,912 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-12 05:05:59,914 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-12 05:06:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:00,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-12 05:06:00,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:06:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 728 proven. 111 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-12 05:06:00,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:06:05,144 WARN L851 $PredicateComparison]: unable to prove that (and (= (mod c_~var_1_23~0 256) 0) (forall ((v_z_13 Int)) (or (< (mod (div v_z_13 (mod c_~var_1_7~0 4294967296)) 4294967296) v_z_13) (< 65535 v_z_13) (< v_z_13 (mod |c_ULTIMATE.start_step_~stepLocal_6~0#1| 256))))) is different from false [2024-11-12 05:06:09,292 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_z_13 Int)) (or (< (mod (div v_z_13 (mod c_~var_1_7~0 4294967296)) 4294967296) v_z_13) (< 65535 v_z_13) (< v_z_13 (mod c_~var_1_14~0 256)))) (= (mod c_~var_1_23~0 256) 0)) is different from false [2024-11-12 05:06:13,554 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_z_13 Int)) (or (< (mod (div v_z_13 (mod c_~var_1_7~0 4294967296)) 4294967296) v_z_13) (< 65535 v_z_13) (< v_z_13 (mod c_~var_1_14~0 256)))) (= (mod c_~var_1_24~0 256) 0)) is different from false [2024-11-12 05:06:13,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:06:13,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886028123] [2024-11-12 05:06:13,675 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 05:06:13,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856798981] [2024-11-12 05:06:13,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856798981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:06:13,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 05:06:13,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2024-11-12 05:06:13,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807788408] [2024-11-12 05:06:13,678 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 05:06:13,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 05:06:13,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:06:13,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 05:06:13,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=166, Unknown=3, NotChecked=84, Total=306 [2024-11-12 05:06:13,680 INFO L87 Difference]: Start difference. First operand 108 states and 144 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-12 05:06:15,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:06:15,117 INFO L93 Difference]: Finished difference Result 263 states and 340 transitions. [2024-11-12 05:06:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-12 05:06:15,121 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 160 [2024-11-12 05:06:15,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:06:15,122 INFO L225 Difference]: With dead ends: 263 [2024-11-12 05:06:15,122 INFO L226 Difference]: Without dead ends: 158 [2024-11-12 05:06:15,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=223, Invalid=598, Unknown=3, NotChecked=168, Total=992 [2024-11-12 05:06:15,123 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 239 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 05:06:15,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 349 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 05:06:15,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-12 05:06:15,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 106. [2024-11-12 05:06:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 73 states have internal predecessors, (88), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 05:06:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 136 transitions. [2024-11-12 05:06:15,138 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 136 transitions. Word has length 160 [2024-11-12 05:06:15,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:06:15,139 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 136 transitions. [2024-11-12 05:06:15,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (24), 4 states have call predecessors, (24), 7 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-12 05:06:15,139 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 136 transitions. [2024-11-12 05:06:15,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 05:06:15,141 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:06:15,141 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:06:15,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 05:06:15,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:06:15,342 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:06:15,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:06:15,343 INFO L85 PathProgramCache]: Analyzing trace with hash -748147457, now seen corresponding path program 1 times [2024-11-12 05:06:15,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:06:15,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074939468] [2024-11-12 05:06:15,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:06:15,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:06:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 05:06:15,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [583689086] [2024-11-12 05:06:15,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:06:15,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:06:15,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:06:15,421 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:06:15,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 05:06:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:06:15,898 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 05:06:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:06:16,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 05:06:16,034 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 05:06:16,035 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:06:16,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 05:06:16,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:06:16,243 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-12 05:06:16,317 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:06:16,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:06:16 BoogieIcfgContainer [2024-11-12 05:06:16,320 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:06:16,321 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:06:16,321 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:06:16,321 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:06:16,321 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:05:52" (3/4) ... [2024-11-12 05:06:16,323 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 05:06:16,324 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:06:16,324 INFO L158 Benchmark]: Toolchain (without parser) took 24289.49ms. Allocated memory was 125.8MB in the beginning and 255.9MB in the end (delta: 130.0MB). Free memory was 57.3MB in the beginning and 194.2MB in the end (delta: -136.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:06:16,325 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory was 84.9MB in the beginning and 84.8MB in the end (delta: 132.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:06:16,325 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.71ms. Allocated memory was 125.8MB in the beginning and 176.2MB in the end (delta: 50.3MB). Free memory was 57.1MB in the beginning and 132.2MB in the end (delta: -75.1MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2024-11-12 05:06:16,325 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.22ms. Allocated memory is still 176.2MB. Free memory was 132.2MB in the beginning and 128.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 05:06:16,325 INFO L158 Benchmark]: Boogie Preprocessor took 59.95ms. Allocated memory is still 176.2MB. Free memory was 128.0MB in the beginning and 120.7MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-12 05:06:16,325 INFO L158 Benchmark]: RCFGBuilder took 445.88ms. Allocated memory is still 176.2MB. Free memory was 119.6MB in the beginning and 92.4MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-12 05:06:16,326 INFO L158 Benchmark]: TraceAbstraction took 23380.36ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 92.4MB in the beginning and 195.3MB in the end (delta: -102.9MB). Peak memory consumption was 102.6MB. Max. memory is 16.1GB. [2024-11-12 05:06:16,326 INFO L158 Benchmark]: Witness Printer took 3.38ms. Allocated memory is still 255.9MB. Free memory was 195.3MB in the beginning and 194.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 05:06:16,327 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory was 84.9MB in the beginning and 84.8MB in the end (delta: 132.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.71ms. Allocated memory was 125.8MB in the beginning and 176.2MB in the end (delta: 50.3MB). Free memory was 57.1MB in the beginning and 132.2MB in the end (delta: -75.1MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.22ms. Allocated memory is still 176.2MB. Free memory was 132.2MB in the beginning and 128.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.95ms. Allocated memory is still 176.2MB. Free memory was 128.0MB in the beginning and 120.7MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 445.88ms. Allocated memory is still 176.2MB. Free memory was 119.6MB in the beginning and 92.4MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 23380.36ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 92.4MB in the beginning and 195.3MB in the end (delta: -102.9MB). Peak memory consumption was 102.6MB. Max. memory is 16.1GB. * Witness Printer took 3.38ms. Allocated memory is still 255.9MB. Free memory was 195.3MB in the beginning and 194.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 188, overapproximation of someBinaryDOUBLEComparisonOperation at line 188. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 4; [L23] unsigned char var_1_2 = 0; [L24] unsigned long int var_1_7 = 2819353023; [L25] signed short int var_1_9 = 25; [L26] signed short int var_1_10 = 25; [L27] signed short int var_1_11 = 0; [L28] float var_1_12 = 255.8; [L29] unsigned char var_1_14 = 200; [L30] unsigned char var_1_15 = 5; [L31] unsigned char var_1_16 = 4; [L32] float var_1_17 = 99999.5; [L33] float var_1_18 = 63.4; [L34] double var_1_19 = 63.5; [L35] double var_1_20 = 9.95; [L36] double var_1_21 = 5.7; [L37] double var_1_22 = 3.85; [L38] unsigned char var_1_23 = 1; [L39] unsigned char var_1_24 = 0; [L40] unsigned long int var_1_25 = 0; [L41] unsigned long int var_1_26 = 16; [L42] unsigned long int var_1_27 = 1840944138; [L43] unsigned short int var_1_28 = 0; [L44] float var_1_29 = 1.1; [L45] signed char var_1_30 = 25; [L46] unsigned char last_1_var_1_23 = 1; [L47] float last_1_var_1_29 = 1.1; VAL [isInitial=0, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=0, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L192] isInitial = 1 [L193] FCALL initially() [L194] int k_loop; [L195] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=0, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L195] COND TRUE k_loop < 1 [L196] CALL updateLastVariables() [L184] last_1_var_1_23 = var_1_23 [L185] last_1_var_1_29 = var_1_29 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=0, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L196] RET updateLastVariables() [L197] CALL updateVariables() [L144] var_1_2 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L145] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L146] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L146] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=2819353023, var_1_9=25] [L147] var_1_7 = __VERIFIER_nondet_ulong() [L148] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L148] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L149] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L149] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=25, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L150] var_1_10 = __VERIFIER_nondet_short() [L151] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L151] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L152] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L152] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=0, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L153] var_1_11 = __VERIFIER_nondet_short() [L154] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L154] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L155] CALL assume_abort_if_not(var_1_11 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L155] RET assume_abort_if_not(var_1_11 <= 32766) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=200, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L156] var_1_14 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_14 >= 191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L157] RET assume_abort_if_not(var_1_14 >= 191) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L158] CALL assume_abort_if_not(var_1_14 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L158] RET assume_abort_if_not(var_1_14 <= 255) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=5, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L159] var_1_15 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L160] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L161] CALL assume_abort_if_not(var_1_15 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L161] RET assume_abort_if_not(var_1_15 <= 64) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=4, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L162] var_1_16 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L163] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L164] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L164] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_17=199999/2, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L165] var_1_17 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L166] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_18=317/5, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L167] var_1_18 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L168] RET assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_20=199/20, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L169] var_1_20 = __VERIFIER_nondet_double() [L170] 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_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L170] 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_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_21=57/10, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L171] var_1_21 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L172] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L173] var_1_24 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L174] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L175] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L175] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L176] var_1_26 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L177] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L178] CALL assume_abort_if_not(var_1_26 <= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=32766, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=32766, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L178] RET assume_abort_if_not(var_1_26 <= 536870912) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=32766, var_1_27=1840944138, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L179] var_1_27 = __VERIFIER_nondet_ulong() [L180] CALL assume_abort_if_not(var_1_27 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=32766, var_1_27=9663676415, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=32766, var_1_27=9663676415, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L180] RET assume_abort_if_not(var_1_27 >= 1073741823) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=32766, var_1_27=9663676415, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L181] CALL assume_abort_if_not(var_1_27 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=32766, var_1_27=9663676415, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=32766, var_1_27=9663676415, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L181] RET assume_abort_if_not(var_1_27 <= 2147483647) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_19=127/2, var_1_1=4, var_1_22=77/20, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=32766, var_1_27=9663676415, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L197] RET updateVariables() [L198] CALL step() [L51] COND TRUE var_1_21 < (256.8 - var_1_20) [L52] var_1_22 = ((((var_1_18) < (var_1_17)) ? (var_1_18) : (var_1_17))) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_22=2, var_1_23=1, var_1_24=0, var_1_25=0, var_1_26=32766, var_1_27=9663676415, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L56] COND FALSE !(((((4.8f) < 0 ) ? -(4.8f) : (4.8f))) == var_1_18) [L59] var_1_23 = var_1_24 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=32766, var_1_27=9663676415, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L61] unsigned long int stepLocal_5 = var_1_26; VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_5=32766, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=32766, var_1_27=9663676415, var_1_28=0, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L62] COND FALSE !(stepLocal_5 < var_1_11) [L69] var_1_28 = var_1_11 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=32766, var_1_27=9663676415, var_1_28=32766, var_1_29=11/10, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L71] COND TRUE last_1_var_1_29 > 1.9 [L72] var_1_29 = var_1_20 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=32766, var_1_27=9663676415, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L76] unsigned char stepLocal_6 = var_1_14; VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_6=255, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=32766, var_1_27=9663676415, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=25, var_1_7=-2147483649, var_1_9=25] [L77] COND TRUE var_1_28 >= stepLocal_6 [L78] var_1_30 = ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=32766, var_1_27=9663676415, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=64, var_1_7=-2147483649, var_1_9=25] [L84] COND FALSE !((var_1_28 <= (var_1_28 / var_1_7)) || var_1_23) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=32766, var_1_27=9663676415, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=64, var_1_7=-2147483649, var_1_9=25] [L87] COND FALSE !(var_1_23 || var_1_23) [L90] var_1_9 = -8 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=32766, var_1_27=9663676415, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=64, var_1_7=-2147483649, var_1_9=-8] [L93] COND FALSE !(var_1_22 < var_1_17) [L96] var_1_25 = ((var_1_27 - var_1_16) + var_1_15) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=9663676415, var_1_26=32766, var_1_27=9663676415, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=64, var_1_7=-2147483649, var_1_9=-8] [L98] signed long int stepLocal_4 = (((var_1_16 - var_1_14) < 0 ) ? -(var_1_16 - var_1_14) : (var_1_16 - var_1_14)); [L99] signed long int stepLocal_3 = 64; VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_3=64, stepLocal_4=191, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=9663676415, var_1_26=32766, var_1_27=9663676415, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=64, var_1_7=-2147483649, var_1_9=-8] [L100] COND TRUE var_1_16 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_4=191, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_17=4, var_1_18=2, var_1_19=127/2, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=9663676415, var_1_26=32766, var_1_27=9663676415, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=64, var_1_7=-2147483649, var_1_9=-8] [L101] COND TRUE var_1_22 != var_1_17 [L102] var_1_19 = var_1_17 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_4=191, var_1_10=-1, var_1_11=32766, var_1_12=1279/5, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=9663676415, var_1_26=32766, var_1_27=9663676415, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=64, var_1_7=-2147483649, var_1_9=-8] [L111] COND FALSE !(var_1_23 || (var_1_19 < var_1_19)) [L118] var_1_12 = var_1_17 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_4=191, var_1_10=-1, var_1_11=32766, var_1_12=4, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=9663676415, var_1_26=32766, var_1_27=9663676415, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=64, var_1_7=-2147483649, var_1_9=-8] [L120] unsigned short int stepLocal_2 = var_1_28; [L121] unsigned char stepLocal_1 = var_1_23; [L122] unsigned long int stepLocal_0 = var_1_7 - var_1_28; VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_0=-2147516415, stepLocal_1=0, stepLocal_2=32766, stepLocal_4=191, var_1_10=-1, var_1_11=32766, var_1_12=4, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=9663676415, var_1_26=32766, var_1_27=9663676415, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=64, var_1_7=-2147483649, var_1_9=-8] [L123] COND FALSE !(stepLocal_1 && var_1_23) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_0=-2147516415, stepLocal_2=32766, stepLocal_4=191, var_1_10=-1, var_1_11=32766, var_1_12=4, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=4, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=9663676415, var_1_26=32766, var_1_27=9663676415, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=64, var_1_7=-2147483649, var_1_9=-8] [L128] COND FALSE !(stepLocal_0 <= ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28)))) [L139] var_1_1 = var_1_28 VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, stepLocal_2=32766, stepLocal_4=191, var_1_10=-1, var_1_11=32766, var_1_12=4, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=32766, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=9663676415, var_1_26=32766, var_1_27=9663676415, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=64, var_1_7=-2147483649, var_1_9=-8] [L198] RET step() [L199] CALL, EXPR property() [L188-L189] return ((((((((((var_1_23 && var_1_23) ? ((var_1_12 == var_1_22) ? (var_1_1 == ((unsigned long int) (var_1_28 + 10u))) : 1) : (((var_1_7 - var_1_28) <= ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28)))) ? ((var_1_22 != var_1_12) ? ((var_1_7 < var_1_28) ? (var_1_1 == ((unsigned long int) var_1_28)) : (var_1_1 == ((unsigned long int) var_1_28))) : (var_1_1 == ((unsigned long int) var_1_28))) : (var_1_1 == ((unsigned long int) var_1_28)))) && (((var_1_28 <= (var_1_28 / var_1_7)) || var_1_23) ? (var_1_9 == ((signed short int) (var_1_10 - var_1_11))) : ((var_1_23 || var_1_23) ? (var_1_9 == ((signed short int) var_1_11)) : (var_1_9 == ((signed short int) -8))))) && ((var_1_23 || (var_1_19 < var_1_19)) ? ((((var_1_14 - var_1_15) - var_1_16) > var_1_10) ? (var_1_12 == ((float) (var_1_17 + var_1_18))) : (var_1_12 == ((float) var_1_18))) : (var_1_12 == ((float) var_1_17)))) && ((var_1_16 >= 64) ? ((var_1_22 != var_1_17) ? (var_1_19 == ((double) var_1_17)) : 1) : ((var_1_25 > ((((var_1_16 - var_1_14) < 0 ) ? -(var_1_16 - var_1_14) : (var_1_16 - var_1_14)))) ? (var_1_19 == ((double) (((((((((499.698) > (var_1_20)) ? (499.698) : (var_1_20))) - var_1_21)) < (var_1_17)) ? ((((((499.698) > (var_1_20)) ? (499.698) : (var_1_20))) - var_1_21)) : (var_1_17))))) : (var_1_19 == ((double) 9.2))))) && ((var_1_21 < (256.8 - var_1_20)) ? (var_1_22 == ((double) ((((var_1_18) < (var_1_17)) ? (var_1_18) : (var_1_17))))) : (var_1_22 == ((double) (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))))))) && ((((((4.8f) < 0 ) ? -(4.8f) : (4.8f))) == var_1_18) ? (var_1_23 == ((unsigned char) (last_1_var_1_23 && (var_1_2 && var_1_24)))) : (var_1_23 == ((unsigned char) var_1_24)))) && ((var_1_22 < var_1_17) ? (var_1_25 == ((unsigned long int) (var_1_16 + ((var_1_14 + var_1_28) + var_1_11)))) : (var_1_25 == ((unsigned long int) ((var_1_27 - var_1_16) + var_1_15))))) && ((var_1_26 < var_1_11) ? (var_1_24 ? (var_1_28 == ((unsigned short int) ((((((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))) > (var_1_14)) ? (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))) : (var_1_14))))) : (var_1_28 == ((unsigned short int) ((((var_1_14) < (var_1_11)) ? (var_1_14) : (var_1_11)))))) : (var_1_28 == ((unsigned short int) var_1_11)))) && ((last_1_var_1_29 > 1.9) ? (var_1_29 == ((float) var_1_20)) : (var_1_29 == ((float) ((((var_1_21 - var_1_20) < 0 ) ? -(var_1_21 - var_1_20) : (var_1_21 - var_1_20))))))) && ((var_1_28 >= var_1_14) ? (var_1_30 == ((signed char) ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))))) : ((! var_1_23) ? (var_1_30 == ((signed char) ((((-1) < 0 ) ? -(-1) : (-1))))) : 1)) ; VAL [\result=0, isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=4, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=32766, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=9663676415, var_1_26=32766, var_1_27=9663676415, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=64, var_1_7=-2147483649, var_1_9=-8] [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=4, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=32766, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=9663676415, var_1_26=32766, var_1_27=9663676415, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=64, var_1_7=-2147483649, var_1_9=-8] [L19] reach_error() VAL [isInitial=1, last_1_var_1_23=1, last_1_var_1_29=11/10, var_1_10=-1, var_1_11=32766, var_1_12=4, var_1_14=255, var_1_15=-192, var_1_16=64, var_1_17=4, var_1_18=2, var_1_19=4, var_1_1=32766, var_1_20=3, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=9663676415, var_1_26=32766, var_1_27=9663676415, var_1_28=32766, var_1_29=3, var_1_2=1, var_1_30=64, var_1_7=-2147483649, var_1_9=-8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.3s, OverallIterations: 6, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1061 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1017 mSDsluCounter, 1697 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1109 mSDsCounter, 216 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1813 IncrementalHoareTripleChecker+Invalid, 2029 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 216 mSolverCounterUnsat, 588 mSDtfsCounter, 1813 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1028 GetRequests, 911 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 14.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=3, InterpolantAutomatonStates: 101, 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, 5 MinimizatonAttempts, 351 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 16.3s InterpolantComputationTime, 1596 NumberOfCodeBlocks, 1596 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1110 ConstructedInterpolants, 0 QuantifiedInterpolants, 4584 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1129 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 7392/7728 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 05:06:16,545 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-12 05:06:16,592 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 137 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_100-1loop_file-97.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 0bd598c6ab4eb0f85d075cd68c94871d585d0d9cc55a581ea912a4da97c7f3b7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:06:18,103 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:06:18,169 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 05:06:18,172 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:06:18,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:06:18,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:06:18,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:06:18,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:06:18,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:06:18,205 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:06:18,205 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:06:18,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:06:18,206 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:06:18,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:06:18,208 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:06:18,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:06:18,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:06:18,208 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:06:18,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:06:18,211 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:06:18,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:06:18,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:06:18,212 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:06:18,212 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 05:06:18,213 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 05:06:18,213 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:06:18,213 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 05:06:18,213 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:06:18,213 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:06:18,214 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:06:18,214 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:06:18,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:06:18,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:06:18,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:06:18,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:06:18,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:06:18,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:06:18,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:06:18,217 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 05:06:18,217 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 05:06:18,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:06:18,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:06:18,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:06:18,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:06:18,219 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 -> 0bd598c6ab4eb0f85d075cd68c94871d585d0d9cc55a581ea912a4da97c7f3b7 [2024-11-12 05:06:18,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:06:18,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:06:18,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:06:18,508 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:06:18,509 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:06:18,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-97.i [2024-11-12 05:06:19,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:06:19,935 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:06:19,936 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-97.i [2024-11-12 05:06:19,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca87ea7b/4eed8df2f788448d9e88186333e109c0/FLAG6494d910b [2024-11-12 05:06:19,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca87ea7b/4eed8df2f788448d9e88186333e109c0 [2024-11-12 05:06:19,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:06:19,961 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:06:19,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:06:19,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:06:19,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:06:19,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:06:19" (1/1) ... [2024-11-12 05:06:19,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50a97734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:19, skipping insertion in model container [2024-11-12 05:06:19,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:06:19" (1/1) ... [2024-11-12 05:06:20,000 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:06:20,160 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_100-1loop_file-97.i[916,929] [2024-11-12 05:06:20,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:06:20,238 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:06:20,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_100-1loop_file-97.i[916,929] [2024-11-12 05:06:20,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:06:20,294 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:06:20,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:20 WrapperNode [2024-11-12 05:06:20,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:06:20,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:06:20,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:06:20,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:06:20,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:20" (1/1) ... [2024-11-12 05:06:20,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:20" (1/1) ... [2024-11-12 05:06:20,346 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2024-11-12 05:06:20,347 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:06:20,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:06:20,347 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:06:20,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:06:20,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:20" (1/1) ... [2024-11-12 05:06:20,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:20" (1/1) ... [2024-11-12 05:06:20,364 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:20" (1/1) ... [2024-11-12 05:06:20,385 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:06:20,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:20" (1/1) ... [2024-11-12 05:06:20,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:20" (1/1) ... [2024-11-12 05:06:20,396 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:20" (1/1) ... [2024-11-12 05:06:20,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:20" (1/1) ... [2024-11-12 05:06:20,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:20" (1/1) ... [2024-11-12 05:06:20,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:20" (1/1) ... [2024-11-12 05:06:20,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:06:20,413 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:06:20,413 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:06:20,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:06:20,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:20" (1/1) ... [2024-11-12 05:06:20,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:06:20,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:06:20,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:06:20,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:06:20,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:06:20,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 05:06:20,491 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:06:20,492 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:06:20,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:06:20,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:06:20,579 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:06:20,581 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:06:27,043 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-12 05:06:27,044 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:06:27,053 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:06:27,053 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:06:27,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:06:27 BoogieIcfgContainer [2024-11-12 05:06:27,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:06:27,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:06:27,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:06:27,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:06:27,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:06:19" (1/3) ... [2024-11-12 05:06:27,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb76bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:06:27, skipping insertion in model container [2024-11-12 05:06:27,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:20" (2/3) ... [2024-11-12 05:06:27,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb76bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:06:27, skipping insertion in model container [2024-11-12 05:06:27,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:06:27" (3/3) ... [2024-11-12 05:06:27,059 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-97.i [2024-11-12 05:06:27,070 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:06:27,071 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:06:27,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:06:27,120 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;@73bbdfcb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:06:27,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:06:27,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 05:06:27,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-12 05:06:27,137 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:06:27,137 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:06:27,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:06:27,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:06:27,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1945232597, now seen corresponding path program 1 times [2024-11-12 05:06:27,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:06:27,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318130995] [2024-11-12 05:06:27,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:06:27,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:06:27,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:06:27,156 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:06:27,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 05:06:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:27,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 05:06:27,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:06:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-12 05:06:27,727 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:06:27,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:06:27,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318130995] [2024-11-12 05:06:27,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318130995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:06:27,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:06:27,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:06:27,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832881793] [2024-11-12 05:06:27,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:06:27,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:06:27,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:06:27,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:06:27,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:06:27,749 INFO L87 Difference]: Start difference. First operand has 82 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 05:06:27,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:06:27,775 INFO L93 Difference]: Finished difference Result 161 states and 277 transitions. [2024-11-12 05:06:27,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:06:27,777 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 159 [2024-11-12 05:06:27,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:06:27,784 INFO L225 Difference]: With dead ends: 161 [2024-11-12 05:06:27,785 INFO L226 Difference]: Without dead ends: 78 [2024-11-12 05:06:27,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:06:27,793 INFO L435 NwaCegarLoop]: 125 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, 125 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:06:27,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:06:27,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-12 05:06:27,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-12 05:06:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 05:06:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 121 transitions. [2024-11-12 05:06:27,839 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 121 transitions. Word has length 159 [2024-11-12 05:06:27,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:06:27,840 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 121 transitions. [2024-11-12 05:06:27,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 05:06:27,840 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 121 transitions. [2024-11-12 05:06:27,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-12 05:06:27,847 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:06:27,847 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:06:27,866 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-12 05:06:28,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:06:28,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:06:28,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:06:28,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1598926285, now seen corresponding path program 1 times [2024-11-12 05:06:28,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:06:28,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203583841] [2024-11-12 05:06:28,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:06:28,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:06:28,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:06:28,053 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:06:28,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 05:06:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:28,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 05:06:28,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:06:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 05:06:31,921 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:06:31,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:06:31,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203583841] [2024-11-12 05:06:31,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203583841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:06:31,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:06:31,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:06:31,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324911815] [2024-11-12 05:06:31,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:06:31,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:06:31,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:06:31,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:06:31,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:06:31,924 INFO L87 Difference]: Start difference. First operand 78 states and 121 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 05:06:39,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:06:43,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:06:49,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:06:53,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:06:53,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:06:53,821 INFO L93 Difference]: Finished difference Result 229 states and 358 transitions. [2024-11-12 05:06:53,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:06:53,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2024-11-12 05:06:53,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:06:53,828 INFO L225 Difference]: With dead ends: 229 [2024-11-12 05:06:53,828 INFO L226 Difference]: Without dead ends: 154 [2024-11-12 05:06:53,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:06:53,829 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 76 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 49 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.8s IncrementalHoareTripleChecker+Time [2024-11-12 05:06:53,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 290 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 65 Invalid, 4 Unknown, 0 Unchecked, 21.8s Time] [2024-11-12 05:06:53,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-12 05:06:53,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 128. [2024-11-12 05:06:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 05:06:53,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 198 transitions. [2024-11-12 05:06:53,855 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 198 transitions. Word has length 159 [2024-11-12 05:06:53,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:06:53,856 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 198 transitions. [2024-11-12 05:06:53,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 05:06:53,858 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 198 transitions. [2024-11-12 05:06:53,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-12 05:06:53,859 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:06:53,859 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:06:53,877 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 (3)] Ended with exit code 0 [2024-11-12 05:06:54,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:06:54,060 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:06:54,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:06:54,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1674972657, now seen corresponding path program 1 times [2024-11-12 05:06:54,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:06:54,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014912226] [2024-11-12 05:06:54,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:06:54,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:06:54,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:06:54,067 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:06:54,068 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 (4)] Waiting until timeout for monitored process [2024-11-12 05:06:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:54,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 05:06:54,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:06:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 365 proven. 12 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2024-11-12 05:06:55,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:06:56,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 05:06:56,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:06:56,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014912226] [2024-11-12 05:06:56,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014912226] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:06:56,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 05:06:56,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2024-11-12 05:06:56,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148098400] [2024-11-12 05:06:56,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 05:06:56,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 05:06:56,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:06:56,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 05:06:56,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 05:06:56,351 INFO L87 Difference]: Start difference. First operand 128 states and 198 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-12 05:07:02,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:07:06,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:07:09,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:07:10,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:07:10,997 INFO L93 Difference]: Finished difference Result 218 states and 327 transitions. [2024-11-12 05:07:10,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 05:07:10,998 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 159 [2024-11-12 05:07:10,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:07:11,000 INFO L225 Difference]: With dead ends: 218 [2024-11-12 05:07:11,000 INFO L226 Difference]: Without dead ends: 142 [2024-11-12 05:07:11,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 309 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2024-11-12 05:07:11,002 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 132 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 57 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2024-11-12 05:07:11,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 414 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 389 Invalid, 2 Unknown, 0 Unchecked, 13.9s Time] [2024-11-12 05:07:11,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-12 05:07:11,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2024-11-12 05:07:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 81 states have (on average 1.2098765432098766) internal successors, (98), 81 states have internal predecessors, (98), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 05:07:11,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 194 transitions. [2024-11-12 05:07:11,032 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 194 transitions. Word has length 159 [2024-11-12 05:07:11,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:07:11,032 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 194 transitions. [2024-11-12 05:07:11,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-12 05:07:11,033 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 194 transitions. [2024-11-12 05:07:11,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-12 05:07:11,034 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:07:11,034 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:07:11,053 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 (4)] Ended with exit code 0 [2024-11-12 05:07:11,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:07:11,235 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:07:11,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:07:11,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1924323327, now seen corresponding path program 1 times [2024-11-12 05:07:11,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:07:11,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044149581] [2024-11-12 05:07:11,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:07:11,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:07:11,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:07:11,242 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:07:11,245 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 (5)] Waiting until timeout for monitored process [2024-11-12 05:07:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:11,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 05:07:11,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:07:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 715 proven. 153 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-11-12 05:07:17,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:07:26,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:07:26,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044149581] [2024-11-12 05:07:26,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044149581] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:07:26,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1914135185] [2024-11-12 05:07:26,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:07:26,151 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 05:07:26,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 05:07:26,152 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 05:07:26,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process