./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.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 c438e6c9197a881b4d4e2319837b570cca3414de745bf48aba5a7ed68a2e7de0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:47:26,821 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:47:26,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:47:26,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:47:26,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:47:26,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:47:26,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:47:26,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:47:26,934 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:47:26,935 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:47:26,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:47:26,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:47:26,937 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:47:26,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:47:26,940 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:47:26,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:47:26,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:47:26,941 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:47:26,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:47:26,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:47:26,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:47:26,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:47:26,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:47:26,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:47:26,956 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:47:26,957 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:47:26,957 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:47:26,957 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:47:26,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:47:26,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:47:26,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:47:26,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:47:26,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:47:26,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:47:26,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:47:26,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:47:26,959 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:47:26,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:47:26,959 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:47:26,959 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:47:26,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:47:26,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:47:26,962 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 -> c438e6c9197a881b4d4e2319837b570cca3414de745bf48aba5a7ed68a2e7de0 [2024-10-13 03:47:27,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:47:27,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:47:27,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:47:27,244 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:47:27,244 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:47:27,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-10-13 03:47:28,717 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:47:28,941 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:47:28,942 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-10-13 03:47:28,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a9adf44f/ccbb97e8b3bc4f94b81cdcd3c48b9575/FLAGe78fa0d8d [2024-10-13 03:47:28,965 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a9adf44f/ccbb97e8b3bc4f94b81cdcd3c48b9575 [2024-10-13 03:47:28,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:47:28,968 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:47:28,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:47:28,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:47:28,974 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:47:28,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:47:28" (1/1) ... [2024-10-13 03:47:28,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37e0cc58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:28, skipping insertion in model container [2024-10-13 03:47:28,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:47:28" (1/1) ... [2024-10-13 03:47:29,007 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:47:29,174 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i[916,929] [2024-10-13 03:47:29,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:47:29,297 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:47:29,313 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i[916,929] [2024-10-13 03:47:29,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:47:29,397 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:47:29,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:29 WrapperNode [2024-10-13 03:47:29,398 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:47:29,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:47:29,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:47:29,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:47:29,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:29" (1/1) ... [2024-10-13 03:47:29,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:29" (1/1) ... [2024-10-13 03:47:29,484 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 193 [2024-10-13 03:47:29,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:47:29,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:47:29,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:47:29,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:47:29,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:29" (1/1) ... [2024-10-13 03:47:29,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:29" (1/1) ... [2024-10-13 03:47:29,503 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:29" (1/1) ... [2024-10-13 03:47:29,534 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 03:47:29,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:29" (1/1) ... [2024-10-13 03:47:29,534 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:29" (1/1) ... [2024-10-13 03:47:29,556 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:29" (1/1) ... [2024-10-13 03:47:29,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:29" (1/1) ... [2024-10-13 03:47:29,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:29" (1/1) ... [2024-10-13 03:47:29,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:29" (1/1) ... [2024-10-13 03:47:29,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:47:29,589 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:47:29,589 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:47:29,589 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:47:29,590 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:29" (1/1) ... [2024-10-13 03:47:29,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:47:29,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:47:29,622 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-10-13 03:47:29,625 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-10-13 03:47:29,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:47:29,673 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:47:29,674 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:47:29,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:47:29,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:47:29,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:47:29,769 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:47:29,771 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:47:30,289 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-13 03:47:30,289 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:47:30,350 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:47:30,350 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:47:30,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:47:30 BoogieIcfgContainer [2024-10-13 03:47:30,351 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:47:30,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:47:30,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:47:30,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:47:30,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:47:28" (1/3) ... [2024-10-13 03:47:30,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a492c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:47:30, skipping insertion in model container [2024-10-13 03:47:30,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:29" (2/3) ... [2024-10-13 03:47:30,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a492c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:47:30, skipping insertion in model container [2024-10-13 03:47:30,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:47:30" (3/3) ... [2024-10-13 03:47:30,362 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-10-13 03:47:30,380 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:47:30,380 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:47:30,454 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:47:30,460 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;@518ce4f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:47:30,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:47:30,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 49 states have (on average 1.469387755102041) internal successors, (72), 50 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 03:47:30,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 03:47:30,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:47:30,477 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:47:30,477 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:47:30,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:47:30,483 INFO L85 PathProgramCache]: Analyzing trace with hash 273692504, now seen corresponding path program 1 times [2024-10-13 03:47:30,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:47:30,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754539091] [2024-10-13 03:47:30,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:47:30,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:47:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:30,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:47:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:30,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:47:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:30,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:47:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:30,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 03:47:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:30,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 03:47:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:30,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 03:47:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:30,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:47:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:30,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:47:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:30,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:47:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:30,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:47:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:30,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:47:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:30,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 03:47:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:30,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:47:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:30,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 03:47:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:30,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:47:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:30,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 03:47:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:30,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:47:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:30,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 03:47:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:30,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:47:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:30,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 03:47:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:30,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:47:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:30,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 03:47:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:47:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 03:47:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 03:47:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-13 03:47:31,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:47:31,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754539091] [2024-10-13 03:47:31,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754539091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:47:31,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:47:31,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:47:31,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726708808] [2024-10-13 03:47:31,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:47:31,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:47:31,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:47:31,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:47:31,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:47:31,051 INFO L87 Difference]: Start difference. First operand has 77 states, 49 states have (on average 1.469387755102041) internal successors, (72), 50 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-13 03:47:31,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:47:31,107 INFO L93 Difference]: Finished difference Result 153 states and 268 transitions. [2024-10-13 03:47:31,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:47:31,110 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 161 [2024-10-13 03:47:31,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:47:31,119 INFO L225 Difference]: With dead ends: 153 [2024-10-13 03:47:31,119 INFO L226 Difference]: Without dead ends: 75 [2024-10-13 03:47:31,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:47:31,128 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:47:31,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:47:31,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-13 03:47:31,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-13 03:47:31,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 03:47:31,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 117 transitions. [2024-10-13 03:47:31,183 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 117 transitions. Word has length 161 [2024-10-13 03:47:31,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:47:31,185 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 117 transitions. [2024-10-13 03:47:31,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-13 03:47:31,185 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 117 transitions. [2024-10-13 03:47:31,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 03:47:31,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:47:31,191 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:47:31,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:47:31,192 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:47:31,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:47:31,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2140495986, now seen corresponding path program 1 times [2024-10-13 03:47:31,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:47:31,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579782182] [2024-10-13 03:47:31,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:47:31,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:47:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:47:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:47:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:47:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 03:47:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 03:47:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 03:47:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:47:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:47:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:47:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:47:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:47:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 03:47:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:47:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 03:47:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:47:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 03:47:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:47:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 03:47:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:47:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 03:47:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:47:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 03:47:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:47:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 03:47:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 03:47:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:31,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-13 03:47:31,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:47:31,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579782182] [2024-10-13 03:47:31,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579782182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:47:31,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:47:31,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:47:31,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597979353] [2024-10-13 03:47:31,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:47:31,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:47:31,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:47:31,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:47:31,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:47:31,995 INFO L87 Difference]: Start difference. First operand 75 states and 117 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-13 03:47:32,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:47:32,206 INFO L93 Difference]: Finished difference Result 224 states and 350 transitions. [2024-10-13 03:47:32,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:47:32,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 161 [2024-10-13 03:47:32,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:47:32,210 INFO L225 Difference]: With dead ends: 224 [2024-10-13 03:47:32,210 INFO L226 Difference]: Without dead ends: 150 [2024-10-13 03:47:32,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:47:32,212 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 85 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:47:32,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 327 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:47:32,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-13 03:47:32,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 120. [2024-10-13 03:47:32,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 67 states have internal predecessors, (86), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-13 03:47:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2024-10-13 03:47:32,238 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 161 [2024-10-13 03:47:32,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:47:32,239 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2024-10-13 03:47:32,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-13 03:47:32,239 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2024-10-13 03:47:32,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-13 03:47:32,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:47:32,242 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:47:32,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:47:32,242 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:47:32,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:47:32,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1432839074, now seen corresponding path program 1 times [2024-10-13 03:47:32,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:47:32,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247499082] [2024-10-13 03:47:32,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:47:32,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:47:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:47:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:47:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:47:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 03:47:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 03:47:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 03:47:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:47:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:47:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 03:47:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:47:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 03:47:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 03:47:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 03:47:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 03:47:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 03:47:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 03:47:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:47:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 03:47:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 03:47:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 03:47:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 03:47:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 03:47:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:47:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 03:47:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 03:47:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-13 03:47:32,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:47:32,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247499082] [2024-10-13 03:47:32,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247499082] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:47:32,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030081646] [2024-10-13 03:47:32,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:47:32,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:47:32,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:47:32,858 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-10-13 03:47:32,860 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-10-13 03:47:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:33,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 03:47:33,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:47:33,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 568 proven. 24 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2024-10-13 03:47:33,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:47:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-13 03:47:33,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030081646] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 03:47:33,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 03:47:33,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-13 03:47:33,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354293136] [2024-10-13 03:47:33,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 03:47:33,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 03:47:33,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:47:33,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 03:47:33,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:47:33,439 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-13 03:47:33,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:47:33,684 INFO L93 Difference]: Finished difference Result 210 states and 316 transitions. [2024-10-13 03:47:33,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:47:33,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 162 [2024-10-13 03:47:33,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:47:33,688 INFO L225 Difference]: With dead ends: 210 [2024-10-13 03:47:33,689 INFO L226 Difference]: Without dead ends: 136 [2024-10-13 03:47:33,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 370 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-13 03:47:33,692 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 176 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:47:33,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 197 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:47:33,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-13 03:47:33,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2024-10-13 03:47:33,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-13 03:47:33,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 191 transitions. [2024-10-13 03:47:33,719 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 191 transitions. Word has length 162 [2024-10-13 03:47:33,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:47:33,720 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 191 transitions. [2024-10-13 03:47:33,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-13 03:47:33,721 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 191 transitions. [2024-10-13 03:47:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 03:47:33,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:47:33,723 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:47:33,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 03:47:33,929 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-10-13 03:47:33,930 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:47:33,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:47:33,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1818060119, now seen corresponding path program 1 times [2024-10-13 03:47:33,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:47:33,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098559542] [2024-10-13 03:47:33,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:47:33,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:47:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 03:47:34,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [438319326] [2024-10-13 03:47:34,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:47:34,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:47:34,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:47:34,115 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-10-13 03:47:34,118 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-10-13 03:47:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:47:34,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:47:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:47:34,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:47:34,560 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:47:34,561 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:47:34,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 03:47:34,764 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-10-13 03:47:34,768 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 03:47:34,884 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:47:34,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:47:34 BoogieIcfgContainer [2024-10-13 03:47:34,892 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:47:34,893 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:47:34,893 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:47:34,893 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:47:34,894 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:47:30" (3/4) ... [2024-10-13 03:47:34,896 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:47:34,897 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:47:34,904 INFO L158 Benchmark]: Toolchain (without parser) took 5935.53ms. Allocated memory was 165.7MB in the beginning and 234.9MB in the end (delta: 69.2MB). Free memory was 111.3MB in the beginning and 200.7MB in the end (delta: -89.4MB). Peak memory consumption was 120.8MB. Max. memory is 16.1GB. [2024-10-13 03:47:34,904 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 165.7MB. Free memory is still 131.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:47:34,907 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.79ms. Allocated memory is still 165.7MB. Free memory was 110.9MB in the beginning and 93.1MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 03:47:34,908 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.22ms. Allocated memory is still 165.7MB. Free memory was 93.1MB in the beginning and 87.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 03:47:34,909 INFO L158 Benchmark]: Boogie Preprocessor took 102.48ms. Allocated memory is still 165.7MB. Free memory was 87.2MB in the beginning and 76.0MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 03:47:34,909 INFO L158 Benchmark]: RCFGBuilder took 761.70ms. Allocated memory is still 165.7MB. Free memory was 76.0MB in the beginning and 125.6MB in the end (delta: -49.5MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2024-10-13 03:47:34,909 INFO L158 Benchmark]: TraceAbstraction took 4537.27ms. Allocated memory was 165.7MB in the beginning and 234.9MB in the end (delta: 69.2MB). Free memory was 125.6MB in the beginning and 63.4MB in the end (delta: 62.2MB). Peak memory consumption was 131.0MB. Max. memory is 16.1GB. [2024-10-13 03:47:34,910 INFO L158 Benchmark]: Witness Printer took 10.29ms. Allocated memory is still 234.9MB. Free memory was 63.4MB in the beginning and 200.7MB in the end (delta: -137.3MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. [2024-10-13 03:47:34,911 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.17ms. Allocated memory is still 165.7MB. Free memory is still 131.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.79ms. Allocated memory is still 165.7MB. Free memory was 110.9MB in the beginning and 93.1MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.22ms. Allocated memory is still 165.7MB. Free memory was 93.1MB in the beginning and 87.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.48ms. Allocated memory is still 165.7MB. Free memory was 87.2MB in the beginning and 76.0MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 761.70ms. Allocated memory is still 165.7MB. Free memory was 76.0MB in the beginning and 125.6MB in the end (delta: -49.5MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4537.27ms. Allocated memory was 165.7MB in the beginning and 234.9MB in the end (delta: 69.2MB). Free memory was 125.6MB in the beginning and 63.4MB in the end (delta: 62.2MB). Peak memory consumption was 131.0MB. Max. memory is 16.1GB. * Witness Printer took 10.29ms. Allocated memory is still 234.9MB. Free memory was 63.4MB in the beginning and 200.7MB in the end (delta: -137.3MB). Peak memory consumption was 2.2MB. 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 187, overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someBinaryArithmeticFLOAToperation at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L23] unsigned char var_1_3 = 0; [L24] float var_1_8 = 128.5; [L25] float var_1_9 = 127.75; [L26] float var_1_10 = 31.8; [L27] float var_1_11 = 32.5; [L28] unsigned char var_1_12 = 8; [L29] unsigned char var_1_13 = 100; [L30] unsigned char var_1_14 = 25; [L31] unsigned char var_1_15 = 32; [L32] unsigned char var_1_16 = 16; [L33] double var_1_17 = 64.8; [L34] unsigned char var_1_18 = 1; [L35] unsigned char var_1_19 = 0; [L36] unsigned char var_1_20 = 0; [L37] signed char var_1_21 = -100; [L38] signed long int var_1_22 = -1; [L39] float var_1_23 = 5.6; [L40] float var_1_24 = 50.88; [L41] signed short int var_1_25 = -5; [L42] unsigned char var_1_26 = 1; [L43] unsigned char var_1_27 = 128; [L44] unsigned char var_1_28 = 5; [L45] signed short int var_1_29 = -64; [L46] unsigned long int var_1_32 = 16; [L47] unsigned char last_1_var_1_12 = 8; [L48] unsigned char last_1_var_1_18 = 1; [L49] signed short int last_1_var_1_25 = -5; [L50] unsigned char last_1_var_1_26 = 1; [L191] isInitial = 1 [L192] FCALL initially() [L193] int k_loop; [L194] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=0, var_1_8=257/2, var_1_9=511/4] [L194] COND TRUE k_loop < 1 [L195] CALL updateLastVariables() [L181] last_1_var_1_12 = var_1_12 [L182] last_1_var_1_18 = var_1_18 [L183] last_1_var_1_25 = var_1_25 [L184] last_1_var_1_26 = var_1_26 [L195] RET updateLastVariables() [L196] CALL updateVariables() [L140] var_1_3 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_8=257/2, var_1_9=511/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_8=257/2, var_1_9=511/4] [L141] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_8=257/2, var_1_9=511/4] [L142] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2, var_1_9=511/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2, var_1_9=511/4] [L142] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2, var_1_9=511/4] [L143] var_1_9 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L144] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_10=159/5, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L145] var_1_10 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L146] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_11=65/2, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L147] var_1_11 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L148] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=100, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L149] var_1_13 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_13 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L150] RET assume_abort_if_not(var_1_13 >= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L151] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L151] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=25, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L152] var_1_14 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L153] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L154] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L154] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=32, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L155] var_1_15 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_15 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L156] RET assume_abort_if_not(var_1_15 >= 31) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L157] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L157] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=16, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L158] var_1_16 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L159] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L160] CALL assume_abort_if_not(var_1_16 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L160] RET assume_abort_if_not(var_1_16 <= 31) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L161] var_1_19 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L162] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L163] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L163] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L164] var_1_20 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L165] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L166] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L166] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=-1, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L167] var_1_22 = __VERIFIER_nondet_long() [L168] CALL assume_abort_if_not(var_1_22 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L168] RET assume_abort_if_not(var_1_22 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L169] CALL assume_abort_if_not(var_1_22 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L169] RET assume_abort_if_not(var_1_22 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L170] CALL assume_abort_if_not(var_1_22 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L170] RET assume_abort_if_not(var_1_22 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_24=1272/25, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L171] var_1_24 = __VERIFIER_nondet_float() [L172] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L172] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=128, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L173] var_1_27 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L174] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L175] CALL assume_abort_if_not(var_1_27 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L175] RET assume_abort_if_not(var_1_27 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=5, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L176] var_1_28 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L177] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L178] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L178] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L196] RET updateVariables() [L197] CALL step() [L54] unsigned char stepLocal_1 = last_1_var_1_18; [L55] signed long int stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_0=8, stepLocal_1=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L56] COND TRUE last_1_var_1_18 || stepLocal_1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_0=8, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=-5, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L57] COND TRUE stepLocal_0 >= last_1_var_1_26 [L58] var_1_1 = (last_1_var_1_12 + last_1_var_1_12) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L65] unsigned long int stepLocal_8 = 10u / var_1_13; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_8=0, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L66] COND TRUE ! var_1_20 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_8=0, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=1, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L67] COND TRUE stepLocal_8 < (var_1_22 + var_1_1) [L68] var_1_26 = ((((var_1_13) < ((var_1_27 - var_1_28))) ? (var_1_13) : ((var_1_27 - var_1_28)))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L73] signed long int stepLocal_4 = ((((var_1_16) < (var_1_13)) ? (var_1_16) : (var_1_13))) / var_1_22; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_4=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=-100, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L74] COND TRUE ((25 + var_1_26) / var_1_15) > stepLocal_4 [L75] var_1_21 = ((((var_1_16) < (var_1_14)) ? (var_1_16) : (var_1_14))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L79] signed short int stepLocal_3 = var_1_1; [L80] signed char stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_2=16, stepLocal_3=16, var_1_12=8, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L81] COND TRUE var_1_1 >= stepLocal_2 [L82] var_1_12 = ((var_1_13 - var_1_14) + (100 - (var_1_15 - var_1_16))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_3=16, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1, var_1_8=257/2] [L90] var_1_8 = ((var_1_9 - var_1_10) + var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_3=16, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1] [L91] COND TRUE \read(var_1_3) [L92] var_1_18 = (var_1_19 || ((var_1_10 > var_1_8) && var_1_20)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_3=16, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1] [L96] unsigned char stepLocal_10 = var_1_26; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=127, stepLocal_3=16, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=16, var_1_3=1] [L97] COND FALSE !(var_1_8 <= (var_1_24 * ((((var_1_11) < (var_1_10)) ? (var_1_11) : (var_1_10))))) [L104] var_1_32 = var_1_27 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=127, stepLocal_3=16, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_17=324/5, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=254, var_1_3=1] [L106] COND TRUE (((((var_1_13) > (0)) ? (var_1_13) : (0))) - var_1_32) >= var_1_32 [L107] var_1_17 = (var_1_10 + var_1_9) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=127, stepLocal_3=16, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_23=28/5, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=254, var_1_3=1] [L113] COND TRUE var_1_32 <= (- var_1_21) [L114] var_1_23 = ((((((var_1_10) < (var_1_9)) ? (var_1_10) : (var_1_9))) - var_1_24) + var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=127, stepLocal_3=16, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=254, var_1_3=1] [L118] signed long int stepLocal_7 = -32; [L119] unsigned long int stepLocal_6 = var_1_32; [L120] unsigned char stepLocal_5 = 10 > 8; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=127, stepLocal_3=16, stepLocal_5=1, stepLocal_6=254, stepLocal_7=-32, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_25=-5, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=254, var_1_3=1] [L121] COND FALSE !(stepLocal_7 > (~ last_1_var_1_25)) [L128] var_1_25 = var_1_14 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=127, stepLocal_3=16, stepLocal_5=1, stepLocal_6=254, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_25=16, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=254, var_1_3=1] [L130] unsigned char stepLocal_9 = var_1_18; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=127, stepLocal_3=16, stepLocal_5=1, stepLocal_6=254, stepLocal_9=0, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_25=16, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=-64, var_1_32=254, var_1_3=1] [L131] COND FALSE !(stepLocal_9 && var_1_18) [L136] var_1_29 = 1000 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, stepLocal_10=127, stepLocal_3=16, stepLocal_5=1, stepLocal_6=254, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_25=16, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=1000, var_1_32=254, var_1_3=1] [L197] RET step() [L198] CALL, EXPR property() [L187-L188] return (((((((((((last_1_var_1_18 || last_1_var_1_18) ? ((last_1_var_1_12 >= last_1_var_1_26) ? (var_1_1 == ((signed short int) (last_1_var_1_12 + last_1_var_1_12))) : (var_1_1 == ((signed short int) last_1_var_1_12))) : (var_1_1 == ((signed short int) last_1_var_1_12))) && (var_1_8 == ((float) ((var_1_9 - var_1_10) + var_1_11)))) && ((var_1_1 >= var_1_21) ? (var_1_12 == ((unsigned char) ((var_1_13 - var_1_14) + (100 - (var_1_15 - var_1_16))))) : ((var_1_1 <= 100) ? (var_1_12 == ((unsigned char) ((((var_1_14) > (var_1_13)) ? (var_1_14) : (var_1_13))))) : (var_1_12 == ((unsigned char) var_1_13))))) && (((((((var_1_13) > (0)) ? (var_1_13) : (0))) - var_1_32) >= var_1_32) ? (var_1_17 == ((double) (var_1_10 + var_1_9))) : (var_1_18 ? (var_1_17 == ((double) var_1_9)) : 1))) && (var_1_3 ? (var_1_18 == ((unsigned char) (var_1_19 || ((var_1_10 > var_1_8) && var_1_20)))) : (var_1_18 == ((unsigned char) ((! (! var_1_19)) || var_1_20))))) && ((((25 + var_1_26) / var_1_15) > (((((var_1_16) < (var_1_13)) ? (var_1_16) : (var_1_13))) / var_1_22)) ? (var_1_21 == ((signed char) ((((var_1_16) < (var_1_14)) ? (var_1_16) : (var_1_14))))) : (var_1_21 == ((signed char) var_1_14)))) && ((var_1_32 <= (- var_1_21)) ? (var_1_23 == ((float) ((((((var_1_10) < (var_1_9)) ? (var_1_10) : (var_1_9))) - var_1_24) + var_1_11))) : (var_1_23 == ((float) ((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))))))) && ((-32 > (~ last_1_var_1_25)) ? (((var_1_10 <= (- var_1_9)) || (10 > 8)) ? ((last_1_var_1_25 > var_1_32) ? (var_1_25 == ((signed short int) var_1_32)) : 1) : 1) : (var_1_25 == ((signed short int) var_1_14)))) && ((! var_1_20) ? (((10u / var_1_13) < (var_1_22 + var_1_1)) ? (var_1_26 == ((unsigned char) ((((var_1_13) < ((var_1_27 - var_1_28))) ? (var_1_13) : ((var_1_27 - var_1_28)))))) : (var_1_26 == ((unsigned char) (var_1_16 + var_1_15)))) : 1)) && ((var_1_18 && var_1_18) ? (((var_1_10 - (var_1_9 + var_1_24)) == var_1_23) ? (var_1_29 == ((signed short int) ((((var_1_14) < (((((1) < (var_1_21)) ? (1) : (var_1_21))))) ? (var_1_14) : (((((1) < (var_1_21)) ? (1) : (var_1_21)))))))) : 1) : (var_1_29 == ((signed short int) 1000)))) && ((var_1_8 <= (var_1_24 * ((((var_1_11) < (var_1_10)) ? (var_1_11) : (var_1_10))))) ? ((var_1_26 > (- (- var_1_26))) ? (var_1_32 == ((unsigned long int) var_1_26)) : (var_1_32 == ((unsigned long int) var_1_13))) : (var_1_32 == ((unsigned long int) var_1_27))) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_25=16, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=1000, var_1_32=254, var_1_3=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_18=1, last_1_var_1_25=-5, last_1_var_1_26=1, var_1_12=182, var_1_13=-129, var_1_14=-496, var_1_15=316, var_1_16=-225, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=0, var_1_21=16, var_1_22=30, var_1_25=16, var_1_26=127, var_1_27=254, var_1_28=383, var_1_29=1000, var_1_32=254, var_1_3=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 4, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 276 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 261 mSDsluCounter, 638 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 331 mSDsCounter, 137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 177 IncrementalHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 137 mSolverCounterUnsat, 307 mSDtfsCounter, 177 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 513 GetRequests, 500 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=3, InterpolantAutomatonStates: 15, 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, 3 MinimizatonAttempts, 38 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 972 NumberOfCodeBlocks, 972 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 803 ConstructedInterpolants, 0 QuantifiedInterpolants, 1503 SizeOfPredicates, 1 NumberOfNonLiveVariables, 386 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 5928/6000 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 03:47:34,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.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 c438e6c9197a881b4d4e2319837b570cca3414de745bf48aba5a7ed68a2e7de0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:47:37,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:47:37,289 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:47:37,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:47:37,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:47:37,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:47:37,335 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:47:37,336 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:47:37,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:47:37,338 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:47:37,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:47:37,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:47:37,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:47:37,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:47:37,341 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:47:37,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:47:37,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:47:37,345 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:47:37,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:47:37,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:47:37,346 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:47:37,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:47:37,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:47:37,346 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:47:37,347 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:47:37,347 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:47:37,347 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:47:37,348 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:47:37,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:47:37,348 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:47:37,349 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:47:37,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:47:37,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:47:37,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:47:37,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:47:37,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:47:37,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:47:37,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:47:37,350 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:47:37,350 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:47:37,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:47:37,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:47:37,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:47:37,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:47:37,353 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:47:37,353 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 -> c438e6c9197a881b4d4e2319837b570cca3414de745bf48aba5a7ed68a2e7de0 [2024-10-13 03:47:37,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:47:37,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:47:37,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:47:37,736 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:47:37,737 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:47:37,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-10-13 03:47:39,341 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:47:39,574 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:47:39,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-10-13 03:47:39,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0fd1d287/f9e33b632d2c4f059116ae37fab8419e/FLAG5ce189a6e [2024-10-13 03:47:39,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0fd1d287/f9e33b632d2c4f059116ae37fab8419e [2024-10-13 03:47:39,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:47:39,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:47:39,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:47:39,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:47:39,613 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:47:39,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:47:39" (1/1) ... [2024-10-13 03:47:39,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45e244a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:39, skipping insertion in model container [2024-10-13 03:47:39,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:47:39" (1/1) ... [2024-10-13 03:47:39,653 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:47:39,841 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i[916,929] [2024-10-13 03:47:39,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:47:39,970 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:47:39,983 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-48.i[916,929] [2024-10-13 03:47:40,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:47:40,065 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:47:40,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:40 WrapperNode [2024-10-13 03:47:40,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:47:40,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:47:40,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:47:40,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:47:40,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:40" (1/1) ... [2024-10-13 03:47:40,089 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:40" (1/1) ... [2024-10-13 03:47:40,135 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2024-10-13 03:47:40,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:47:40,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:47:40,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:47:40,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:47:40,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:40" (1/1) ... [2024-10-13 03:47:40,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:40" (1/1) ... [2024-10-13 03:47:40,165 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:40" (1/1) ... [2024-10-13 03:47:40,188 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 03:47:40,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:40" (1/1) ... [2024-10-13 03:47:40,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:40" (1/1) ... [2024-10-13 03:47:40,207 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:40" (1/1) ... [2024-10-13 03:47:40,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:40" (1/1) ... [2024-10-13 03:47:40,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:40" (1/1) ... [2024-10-13 03:47:40,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:40" (1/1) ... [2024-10-13 03:47:40,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:47:40,232 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:47:40,232 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:47:40,232 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:47:40,233 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:40" (1/1) ... [2024-10-13 03:47:40,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:47:40,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:47:40,269 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-10-13 03:47:40,272 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-10-13 03:47:40,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:47:40,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:47:40,332 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:47:40,332 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:47:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:47:40,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:47:40,435 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:47:40,437 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:47:46,678 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-13 03:47:46,679 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:47:46,772 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:47:46,773 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:47:46,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:47:46 BoogieIcfgContainer [2024-10-13 03:47:46,773 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:47:46,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:47:46,779 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:47:46,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:47:46,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:47:39" (1/3) ... [2024-10-13 03:47:46,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487ebbc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:47:46, skipping insertion in model container [2024-10-13 03:47:46,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:47:40" (2/3) ... [2024-10-13 03:47:46,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487ebbc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:47:46, skipping insertion in model container [2024-10-13 03:47:46,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:47:46" (3/3) ... [2024-10-13 03:47:46,788 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-48.i [2024-10-13 03:47:46,805 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:47:46,806 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:47:46,878 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:47:46,888 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;@1d0da25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:47:46,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:47:46,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 49 states have (on average 1.469387755102041) internal successors, (72), 50 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 03:47:46,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 03:47:46,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:47:46,915 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:47:46,916 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:47:46,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:47:46,923 INFO L85 PathProgramCache]: Analyzing trace with hash 273692504, now seen corresponding path program 1 times [2024-10-13 03:47:46,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:47:46,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267275284] [2024-10-13 03:47:46,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:47:46,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:47:46,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:47:46,945 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-10-13 03:47:46,946 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-10-13 03:47:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:47,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:47:47,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:47:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 03:47:47,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:47:47,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:47:47,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267275284] [2024-10-13 03:47:47,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [267275284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:47:47,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:47:47,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:47:47,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440189178] [2024-10-13 03:47:47,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:47:47,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:47:47,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:47:47,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:47:47,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:47:47,601 INFO L87 Difference]: Start difference. First operand has 77 states, 49 states have (on average 1.469387755102041) internal successors, (72), 50 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-13 03:47:51,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:47:51,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:47:51,877 INFO L93 Difference]: Finished difference Result 153 states and 268 transitions. [2024-10-13 03:47:51,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:47:51,879 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 161 [2024-10-13 03:47:51,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:47:51,886 INFO L225 Difference]: With dead ends: 153 [2024-10-13 03:47:51,886 INFO L226 Difference]: Without dead ends: 75 [2024-10-13 03:47:51,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:47:51,892 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:47:51,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-13 03:47:51,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-13 03:47:51,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-13 03:47:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 03:47:51,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 117 transitions. [2024-10-13 03:47:51,930 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 117 transitions. Word has length 161 [2024-10-13 03:47:51,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:47:51,931 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 117 transitions. [2024-10-13 03:47:51,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-13 03:47:51,931 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 117 transitions. [2024-10-13 03:47:51,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 03:47:51,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:47:51,935 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:47:51,954 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-10-13 03:47:52,136 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-10-13 03:47:52,136 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:47:52,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:47:52,137 INFO L85 PathProgramCache]: Analyzing trace with hash -2140495986, now seen corresponding path program 1 times [2024-10-13 03:47:52,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:47:52,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106527749] [2024-10-13 03:47:52,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:47:52,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:47:52,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:47:52,142 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-10-13 03:47:52,143 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-10-13 03:47:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:47:52,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 03:47:52,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:47:54,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-13 03:47:54,510 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:47:54,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:47:54,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106527749] [2024-10-13 03:47:54,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106527749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:47:54,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:47:54,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:47:54,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932270313] [2024-10-13 03:47:54,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:47:54,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:47:54,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:47:54,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:47:54,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:47:54,514 INFO L87 Difference]: Start difference. First operand 75 states and 117 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-13 03:47:58,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:48:02,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:48:06,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:48:11,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:48:15,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:48:19,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:48:19,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:48:19,440 INFO L93 Difference]: Finished difference Result 224 states and 350 transitions. [2024-10-13 03:48:19,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:48:19,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 161 [2024-10-13 03:48:19,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:48:19,445 INFO L225 Difference]: With dead ends: 224 [2024-10-13 03:48:19,445 INFO L226 Difference]: Without dead ends: 150 [2024-10-13 03:48:19,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:48:19,447 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 83 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 51 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.8s IncrementalHoareTripleChecker+Time [2024-10-13 03:48:19,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 437 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 26 Invalid, 6 Unknown, 0 Unchecked, 24.8s Time] [2024-10-13 03:48:19,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-13 03:48:19,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 120. [2024-10-13 03:48:19,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 67 states have internal predecessors, (86), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-13 03:48:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2024-10-13 03:48:19,492 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 161 [2024-10-13 03:48:19,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:48:19,493 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2024-10-13 03:48:19,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-13 03:48:19,494 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2024-10-13 03:48:19,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-13 03:48:19,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:48:19,498 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:48:19,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 03:48:19,699 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-10-13 03:48:19,700 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:48:19,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:48:19,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1432839074, now seen corresponding path program 1 times [2024-10-13 03:48:19,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:48:19,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754311304] [2024-10-13 03:48:19,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:48:19,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:48:19,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:48:19,703 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-10-13 03:48:19,704 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-10-13 03:48:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:48:20,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 03:48:20,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:48:20,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 568 proven. 24 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2024-10-13 03:48:20,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:48:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-13 03:48:22,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:48:22,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754311304] [2024-10-13 03:48:22,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754311304] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 03:48:22,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 03:48:22,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-13 03:48:22,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965018587] [2024-10-13 03:48:22,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 03:48:22,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 03:48:22,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:48:22,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 03:48:22,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:48:22,214 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-13 03:48:27,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:48:31,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:48:34,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:48:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:48:34,360 INFO L93 Difference]: Finished difference Result 210 states and 316 transitions. [2024-10-13 03:48:34,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:48:34,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 162 [2024-10-13 03:48:34,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:48:34,364 INFO L225 Difference]: With dead ends: 210 [2024-10-13 03:48:34,364 INFO L226 Difference]: Without dead ends: 136 [2024-10-13 03:48:34,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 316 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-13 03:48:34,366 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 177 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 73 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2024-10-13 03:48:34,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 194 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 143 Invalid, 2 Unknown, 0 Unchecked, 11.9s Time] [2024-10-13 03:48:34,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-13 03:48:34,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2024-10-13 03:48:34,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-13 03:48:34,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 191 transitions. [2024-10-13 03:48:34,388 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 191 transitions. Word has length 162 [2024-10-13 03:48:34,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:48:34,389 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 191 transitions. [2024-10-13 03:48:34,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-13 03:48:34,390 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 191 transitions. [2024-10-13 03:48:34,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 03:48:34,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:48:34,392 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:48:34,411 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-10-13 03:48:34,592 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-10-13 03:48:34,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:48:34,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:48:34,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1818060119, now seen corresponding path program 1 times [2024-10-13 03:48:34,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:48:34,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726637084] [2024-10-13 03:48:34,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:48:34,595 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:48:34,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:48:34,599 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-10-13 03:48:34,600 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-10-13 03:48:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:48:36,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-10-13 03:48:36,841 INFO L278 TraceCheckSpWp]: Computing forward predicates...