./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-while_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-84.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 551891823d05010aa1b34702044285dbd006dd782691a051b6d02a0f9d69b6f6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:22:10,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:22:10,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:22:10,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:22:10,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:22:10,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:22:10,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:22:10,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:22:10,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:22:10,375 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:22:10,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:22:10,376 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:22:10,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:22:10,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:22:10,377 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:22:10,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:22:10,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:22:10,378 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:22:10,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:22:10,379 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:22:10,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:22:10,383 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:22:10,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:22:10,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:22:10,384 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:22:10,384 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:22:10,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:22:10,385 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:22:10,385 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:22:10,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:22:10,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:22:10,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:22:10,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:22:10,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:22:10,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:22:10,386 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:22:10,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:22:10,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:22:10,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:22:10,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:22:10,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:22:10,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:22:10,390 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 551891823d05010aa1b34702044285dbd006dd782691a051b6d02a0f9d69b6f6 [2024-10-11 11:22:10,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:22:10,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:22:10,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:22:10,705 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:22:10,706 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:22:10,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-84.i [2024-10-11 11:22:12,205 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:22:12,495 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:22:12,496 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-84.i [2024-10-11 11:22:12,513 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d7b7da628/6711290507684b208f27543fe910b1a9/FLAG00a4da75c [2024-10-11 11:22:12,530 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d7b7da628/6711290507684b208f27543fe910b1a9 [2024-10-11 11:22:12,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:22:12,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:22:12,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:22:12,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:22:12,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:22:12,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:22:12" (1/1) ... [2024-10-11 11:22:12,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13507d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:12, skipping insertion in model container [2024-10-11 11:22:12,548 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:22:12" (1/1) ... [2024-10-11 11:22:12,588 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:22:12,800 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-while_file-84.i[916,929] [2024-10-11 11:22:12,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:22:12,892 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:22:12,907 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-while_file-84.i[916,929] [2024-10-11 11:22:12,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:22:12,991 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:22:12,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:12 WrapperNode [2024-10-11 11:22:12,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:22:12,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:22:12,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:22:13,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:22:13,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:12" (1/1) ... [2024-10-11 11:22:13,025 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:12" (1/1) ... [2024-10-11 11:22:13,074 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2024-10-11 11:22:13,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:22:13,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:22:13,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:22:13,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:22:13,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:12" (1/1) ... [2024-10-11 11:22:13,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:12" (1/1) ... [2024-10-11 11:22:13,092 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:12" (1/1) ... [2024-10-11 11:22:13,123 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:22:13,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:12" (1/1) ... [2024-10-11 11:22:13,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:12" (1/1) ... [2024-10-11 11:22:13,147 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:12" (1/1) ... [2024-10-11 11:22:13,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:12" (1/1) ... [2024-10-11 11:22:13,161 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:12" (1/1) ... [2024-10-11 11:22:13,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:12" (1/1) ... [2024-10-11 11:22:13,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:22:13,177 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:22:13,178 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:22:13,178 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:22:13,180 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:12" (1/1) ... [2024-10-11 11:22:13,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:22:13,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:22:13,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:22:13,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:22:13,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:22:13,275 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:22:13,276 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:22:13,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:22:13,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:22:13,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:22:13,378 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:22:13,381 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:22:13,871 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-11 11:22:13,871 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:22:13,925 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:22:13,925 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:22:13,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:22:13 BoogieIcfgContainer [2024-10-11 11:22:13,927 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:22:13,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:22:13,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:22:13,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:22:13,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:22:12" (1/3) ... [2024-10-11 11:22:13,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@591a136f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:22:13, skipping insertion in model container [2024-10-11 11:22:13,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:12" (2/3) ... [2024-10-11 11:22:13,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@591a136f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:22:13, skipping insertion in model container [2024-10-11 11:22:13,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:22:13" (3/3) ... [2024-10-11 11:22:13,938 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-84.i [2024-10-11 11:22:13,956 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:22:13,957 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:22:14,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:22:14,030 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;@6f4dfa83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:22:14,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:22:14,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 11:22:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 11:22:14,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:22:14,049 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:22:14,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:22:14,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:22:14,054 INFO L85 PathProgramCache]: Analyzing trace with hash 821173520, now seen corresponding path program 1 times [2024-10-11 11:22:14,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:22:14,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631759845] [2024-10-11 11:22:14,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:22:14,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:22:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:22:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 11:22:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 11:22:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 11:22:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 11:22:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:22:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 11:22:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 11:22:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 11:22:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 11:22:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 11:22:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 11:22:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 11:22:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:22:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 11:22:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:22:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 11:22:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:22:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:22:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 11:22:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:22:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 11:22:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:22:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 11:22:14,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:22:14,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631759845] [2024-10-11 11:22:14,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631759845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:22:14,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:22:14,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:22:14,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814635373] [2024-10-11 11:22:14,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:22:14,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:22:14,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:22:14,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:22:14,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:22:14,792 INFO L87 Difference]: Start difference. First operand has 74 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 11:22:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:22:14,960 INFO L93 Difference]: Finished difference Result 180 states and 317 transitions. [2024-10-11 11:22:14,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:22:14,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 150 [2024-10-11 11:22:14,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:22:14,985 INFO L225 Difference]: With dead ends: 180 [2024-10-11 11:22:14,986 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 11:22:14,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:22:14,997 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 44 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:22:15,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 231 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:22:15,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 11:22:15,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2024-10-11 11:22:15,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 71 states have internal predecessors, (96), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 11:22:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 158 transitions. [2024-10-11 11:22:15,074 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 158 transitions. Word has length 150 [2024-10-11 11:22:15,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:22:15,075 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 158 transitions. [2024-10-11 11:22:15,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 11:22:15,076 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 158 transitions. [2024-10-11 11:22:15,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 11:22:15,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:22:15,084 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:22:15,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:22:15,085 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:22:15,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:22:15,086 INFO L85 PathProgramCache]: Analyzing trace with hash 878431822, now seen corresponding path program 1 times [2024-10-11 11:22:15,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:22:15,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504759070] [2024-10-11 11:22:15,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:22:15,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:22:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:22:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 11:22:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 11:22:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 11:22:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 11:22:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:22:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 11:22:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 11:22:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 11:22:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 11:22:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 11:22:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 11:22:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 11:22:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:22:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 11:22:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:22:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 11:22:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:22:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:22:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 11:22:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:22:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 11:22:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:22:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 11:22:15,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:22:15,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504759070] [2024-10-11 11:22:15,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504759070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:22:15,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:22:15,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:22:15,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033652998] [2024-10-11 11:22:15,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:22:15,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:22:15,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:22:15,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:22:15,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:22:15,490 INFO L87 Difference]: Start difference. First operand 104 states and 158 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 11:22:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:22:15,597 INFO L93 Difference]: Finished difference Result 207 states and 315 transitions. [2024-10-11 11:22:15,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:22:15,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 150 [2024-10-11 11:22:15,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:22:15,602 INFO L225 Difference]: With dead ends: 207 [2024-10-11 11:22:15,603 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 11:22:15,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:22:15,605 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:22:15,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 196 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:22:15,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 11:22:15,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-11 11:22:15,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 71 states have internal predecessors, (95), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 11:22:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 157 transitions. [2024-10-11 11:22:15,632 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 157 transitions. Word has length 150 [2024-10-11 11:22:15,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:22:15,633 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 157 transitions. [2024-10-11 11:22:15,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 11:22:15,634 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 157 transitions. [2024-10-11 11:22:15,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 11:22:15,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:22:15,640 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:22:15,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:22:15,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:22:15,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:22:15,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1465237836, now seen corresponding path program 1 times [2024-10-11 11:22:15,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:22:15,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302899438] [2024-10-11 11:22:15,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:22:15,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:22:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:22:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 11:22:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 11:22:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 11:22:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 11:22:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:22:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 11:22:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 11:22:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 11:22:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 11:22:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 11:22:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 11:22:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 11:22:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:22:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 11:22:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:22:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 11:22:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:22:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:22:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 11:22:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:22:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 11:22:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:22:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:16,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 11:22:16,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:22:16,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302899438] [2024-10-11 11:22:16,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302899438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:22:16,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:22:16,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:22:16,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539101111] [2024-10-11 11:22:16,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:22:16,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:22:16,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:22:16,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:22:16,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:22:16,210 INFO L87 Difference]: Start difference. First operand 104 states and 157 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 11:22:16,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:22:16,287 INFO L93 Difference]: Finished difference Result 209 states and 314 transitions. [2024-10-11 11:22:16,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:22:16,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 150 [2024-10-11 11:22:16,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:22:16,291 INFO L225 Difference]: With dead ends: 209 [2024-10-11 11:22:16,291 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 11:22:16,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-11 11:22:16,297 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 44 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:22:16,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 358 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:22:16,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 11:22:16,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2024-10-11 11:22:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 70 states have internal predecessors, (93), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 11:22:16,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 155 transitions. [2024-10-11 11:22:16,318 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 155 transitions. Word has length 150 [2024-10-11 11:22:16,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:22:16,321 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 155 transitions. [2024-10-11 11:22:16,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 11:22:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 155 transitions. [2024-10-11 11:22:16,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 11:22:16,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:22:16,327 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:22:16,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:22:16,328 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:22:16,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:22:16,328 INFO L85 PathProgramCache]: Analyzing trace with hash 376140806, now seen corresponding path program 1 times [2024-10-11 11:22:16,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:22:16,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049756607] [2024-10-11 11:22:16,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:22:16,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:22:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:22:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 11:22:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 11:22:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 11:22:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 11:22:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:22:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 11:22:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 11:22:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 11:22:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 11:22:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 11:22:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 11:22:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 11:22:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:22:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 11:22:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 11:22:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 11:22:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 11:22:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 11:22:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 11:22:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:22:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 11:22:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 11:22:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:17,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 11:22:17,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:22:17,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049756607] [2024-10-11 11:22:17,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049756607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:22:17,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:22:17,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 11:22:17,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668404191] [2024-10-11 11:22:17,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:22:17,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:22:17,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:22:17,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:22:17,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:22:17,288 INFO L87 Difference]: Start difference. First operand 103 states and 155 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 11:22:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:22:18,024 INFO L93 Difference]: Finished difference Result 471 states and 707 transitions. [2024-10-11 11:22:18,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:22:18,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 150 [2024-10-11 11:22:18,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:22:18,029 INFO L225 Difference]: With dead ends: 471 [2024-10-11 11:22:18,029 INFO L226 Difference]: Without dead ends: 369 [2024-10-11 11:22:18,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 11:22:18,031 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 259 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 11:22:18,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 526 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 11:22:18,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-11 11:22:18,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 213. [2024-10-11 11:22:18,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 146 states have (on average 1.36986301369863) internal successors, (200), 148 states have internal predecessors, (200), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-11 11:22:18,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 324 transitions. [2024-10-11 11:22:18,087 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 324 transitions. Word has length 150 [2024-10-11 11:22:18,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:22:18,087 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 324 transitions. [2024-10-11 11:22:18,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 11:22:18,088 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 324 transitions. [2024-10-11 11:22:18,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 11:22:18,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:22:18,090 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:22:18,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:22:18,090 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:22:18,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:22:18,090 INFO L85 PathProgramCache]: Analyzing trace with hash 376200388, now seen corresponding path program 1 times [2024-10-11 11:22:18,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:22:18,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547656042] [2024-10-11 11:22:18,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:22:18,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:22:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:22:18,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [305288781] [2024-10-11 11:22:18,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:22:18,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:22:18,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:22:18,221 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:22:18,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:22:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:22:18,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:22:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:22:18,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:22:18,686 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:22:18,687 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:22:18,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 11:22:18,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:22:18,894 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 11:22:19,039 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:22:19,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:22:19 BoogieIcfgContainer [2024-10-11 11:22:19,043 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:22:19,044 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:22:19,044 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:22:19,044 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:22:19,045 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:22:13" (3/4) ... [2024-10-11 11:22:19,047 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:22:19,048 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:22:19,049 INFO L158 Benchmark]: Toolchain (without parser) took 6513.24ms. Allocated memory was 123.7MB in the beginning and 186.6MB in the end (delta: 62.9MB). Free memory was 53.2MB in the beginning and 138.4MB in the end (delta: -85.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:22:19,049 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 123.7MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:22:19,051 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.81ms. Allocated memory was 123.7MB in the beginning and 155.2MB in the end (delta: 31.5MB). Free memory was 52.9MB in the beginning and 120.0MB in the end (delta: -67.0MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2024-10-11 11:22:19,051 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.88ms. Allocated memory is still 155.2MB. Free memory was 118.9MB in the beginning and 113.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:22:19,052 INFO L158 Benchmark]: Boogie Preprocessor took 100.71ms. Allocated memory is still 155.2MB. Free memory was 113.7MB in the beginning and 102.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 11:22:19,052 INFO L158 Benchmark]: RCFGBuilder took 749.63ms. Allocated memory is still 155.2MB. Free memory was 102.1MB in the beginning and 68.6MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-11 11:22:19,052 INFO L158 Benchmark]: TraceAbstraction took 5114.37ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 67.5MB in the beginning and 138.4MB in the end (delta: -70.9MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2024-10-11 11:22:19,053 INFO L158 Benchmark]: Witness Printer took 4.12ms. Allocated memory is still 186.6MB. Free memory is still 138.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:22:19,057 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.21ms. Allocated memory is still 123.7MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 457.81ms. Allocated memory was 123.7MB in the beginning and 155.2MB in the end (delta: 31.5MB). Free memory was 52.9MB in the beginning and 120.0MB in the end (delta: -67.0MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.88ms. Allocated memory is still 155.2MB. Free memory was 118.9MB in the beginning and 113.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.71ms. Allocated memory is still 155.2MB. Free memory was 113.7MB in the beginning and 102.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 749.63ms. Allocated memory is still 155.2MB. Free memory was 102.1MB in the beginning and 68.6MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5114.37ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 67.5MB in the beginning and 138.4MB in the end (delta: -70.9MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. * Witness Printer took 4.12ms. Allocated memory is still 186.6MB. Free memory is still 138.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 183, overapproximation of someBinaryArithmeticDOUBLEoperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of someBinaryArithmeticFLOAToperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 99999999999.75; [L23] float var_1_4 = 31.25; [L24] float var_1_5 = 0.0; [L25] float var_1_6 = 99.5; [L26] float var_1_7 = 500.5; [L27] double var_1_8 = 199.96; [L28] double var_1_9 = 256.95; [L29] signed long int var_1_11 = 1523382513; [L30] double var_1_14 = 32.6; [L31] double var_1_15 = 0.875; [L32] unsigned short int var_1_16 = 1; [L33] unsigned char var_1_17 = 1; [L34] float var_1_18 = 0.3; [L35] signed short int var_1_19 = 4; [L36] unsigned char var_1_20 = 0; [L37] unsigned char var_1_24 = 0; [L38] unsigned char var_1_25 = 16; [L39] unsigned char var_1_26 = 5; [L40] signed short int var_1_27 = 64; [L41] unsigned char var_1_28 = 1; [L42] float var_1_29 = 64.5; [L43] float var_1_30 = 0.0; [L44] unsigned long int var_1_31 = 2; [L45] unsigned long int var_1_32 = 1140371764; [L46] unsigned long int var_1_33 = 3119542188; [L47] double var_1_34 = 10.5; [L48] unsigned short int last_1_var_1_16 = 1; [L49] signed short int last_1_var_1_19 = 4; [L50] signed short int last_1_var_1_27 = 64; [L51] float last_1_var_1_29 = 64.5; [L52] unsigned long int last_1_var_1_31 = 2; [L187] isInitial = 1 [L188] FCALL initially() [L189] COND TRUE 1 [L190] CALL updateLastVariables() [L176] last_1_var_1_16 = var_1_16 [L177] last_1_var_1_19 = var_1_19 [L178] last_1_var_1_27 = var_1_27 [L179] last_1_var_1_29 = var_1_29 [L180] last_1_var_1_31 = var_1_31 [L190] RET updateLastVariables() [L191] CALL updateVariables() [L136] var_1_4 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_5=0, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_5=0, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L137] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_5=0, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L138] var_1_5 = __VERIFIER_nondet_float() [L139] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L139] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L140] var_1_6 = __VERIFIER_nondet_float() [L141] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L141] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L142] var_1_7 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L143] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L144] var_1_11 = __VERIFIER_nondet_long() [L145] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L145] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L146] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L146] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L147] var_1_14 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_14 >= -230584.3009213691390e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L148] RET assume_abort_if_not((var_1_14 >= -230584.3009213691390e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L149] var_1_15 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_15 >= -230584.3009213691390e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L150] RET assume_abort_if_not((var_1_15 >= -230584.3009213691390e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L151] var_1_17 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L152] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L153] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L153] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L154] var_1_20 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L155] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L156] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L156] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L157] var_1_25 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L158] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L159] CALL assume_abort_if_not(var_1_25 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L159] RET assume_abort_if_not(var_1_25 <= 64) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L160] var_1_26 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L161] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L162] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L162] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L163] var_1_28 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L164] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L165] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L165] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L166] var_1_30 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_30 >= 2305843.009213691390e+12F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L167] RET assume_abort_if_not((var_1_30 >= 2305843.009213691390e+12F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L168] var_1_32 = __VERIFIER_nondet_ulong() [L169] CALL assume_abort_if_not(var_1_32 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_31=2, var_1_32=1073741824, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_31=2, var_1_32=1073741824, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L169] RET assume_abort_if_not(var_1_32 >= 1073741824) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_31=2, var_1_32=1073741824, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L170] CALL assume_abort_if_not(var_1_32 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_31=2, var_1_32=1073741824, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_31=2, var_1_32=1073741824, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L170] RET assume_abort_if_not(var_1_32 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_31=2, var_1_32=1073741824, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L171] var_1_33 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_33 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_31=2, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_31=2, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L172] RET assume_abort_if_not(var_1_33 >= 2147483647) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_31=2, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L173] CALL assume_abort_if_not(var_1_33 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_31=2, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_31=2, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L173] RET assume_abort_if_not(var_1_33 <= 4294967294) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_31=2, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L191] RET updateVariables() [L192] CALL step() [L56] unsigned long int stepLocal_1 = last_1_var_1_31; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_31=2, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L57] COND FALSE !(var_1_4 < (last_1_var_1_29 + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) [L64] var_1_8 = var_1_7 VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_31=2, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L66] COND FALSE !(! var_1_20) [L73] var_1_24 = var_1_26 VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_31=2, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L75] signed long int stepLocal_6 = (((var_1_24) < (var_1_24)) ? (var_1_24) : (var_1_24)); [L76] unsigned char stepLocal_5 = var_1_28; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_5=-255, stepLocal_6=0, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_31=2, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L77] COND FALSE !(stepLocal_6 < var_1_25) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_5=-255, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_31=2, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L82] signed long int stepLocal_0 = ~ var_1_24; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_0=-1, stepLocal_1=2, stepLocal_5=-255, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_31=2, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L83] COND TRUE stepLocal_0 <= var_1_24 [L84] var_1_1 = (var_1_4 - (var_1_5 - ((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))))) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_5=-255, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_29=129/2, var_1_31=2, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L86] var_1_29 = (var_1_6 + ((var_1_30 - 7.6f) - var_1_7)) [L87] var_1_31 = ((((((var_1_11 + var_1_32)) > (var_1_33)) ? ((var_1_11 + var_1_32)) : (var_1_33))) - var_1_26) [L88] unsigned char stepLocal_3 = var_1_24; [L89] unsigned long int stepLocal_2 = var_1_31; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=4294967231, stepLocal_3=0, stepLocal_5=-255, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_31=4294967231, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L90] COND FALSE !(\read(var_1_17)) [L97] var_1_16 = var_1_27 VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=4294967231, stepLocal_3=0, stepLocal_5=-255, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_31=4294967231, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L99] signed long int stepLocal_8 = ~ var_1_16; [L100] signed long int stepLocal_7 = var_1_24 / var_1_11; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=4294967231, stepLocal_3=0, stepLocal_5=-255, stepLocal_7=0, stepLocal_8=-65, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_31=4294967231, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L101] COND FALSE !(stepLocal_8 > var_1_31) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=4294967231, stepLocal_3=0, stepLocal_5=-255, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_31=4294967231, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L108] unsigned char stepLocal_4 = var_1_17; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=4294967231, stepLocal_3=0, stepLocal_4=0, stepLocal_5=-255, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_31=4294967231, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L109] COND FALSE !(stepLocal_4 && var_1_20) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=4294967231, stepLocal_3=0, stepLocal_5=-255, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_31=4294967231, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L116] COND FALSE !((var_1_1 * (- var_1_5)) < (var_1_6 - var_1_7)) [L123] var_1_19 = ((var_1_16 + var_1_24) + 16) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=4294967231, stepLocal_3=0, stepLocal_5=-255, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=80, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_31=4294967231, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L126] COND TRUE (var_1_19 - var_1_16) < ((var_1_11 - var_1_24) - var_1_24) [L127] var_1_9 = (var_1_7 + ((((var_1_6) > ((var_1_14 + var_1_15))) ? (var_1_6) : ((var_1_14 + var_1_15))))) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=4294967231, stepLocal_3=0, stepLocal_5=-255, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=80, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_31=4294967231, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2] [L131] COND FALSE !(var_1_19 <= var_1_16) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=4294967231, stepLocal_3=0, stepLocal_5=-255, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=80, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_31=4294967231, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2] [L192] RET step() [L193] CALL, EXPR property() [L183-L184] return ((((((((((((~ var_1_24) <= var_1_24) ? (var_1_1 == ((float) (var_1_4 - (var_1_5 - ((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))))))) : 1) && ((var_1_4 < (last_1_var_1_29 + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) ? ((last_1_var_1_19 < last_1_var_1_31) ? (var_1_8 == ((double) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) + var_1_7))) : (var_1_8 == ((double) var_1_4))) : (var_1_8 == ((double) var_1_7)))) && (((var_1_19 - var_1_16) < ((var_1_11 - var_1_24) - var_1_24)) ? (var_1_9 == ((double) (var_1_7 + ((((var_1_6) > ((var_1_14 + var_1_15))) ? (var_1_6) : ((var_1_14 + var_1_15))))))) : (var_1_9 == ((double) (var_1_7 - var_1_5))))) && (var_1_17 ? ((var_1_11 <= var_1_24) ? ((var_1_24 <= var_1_31) ? (var_1_16 == ((unsigned short int) var_1_27)) : 1) : 1) : (var_1_16 == ((unsigned short int) var_1_27)))) && ((var_1_19 <= var_1_16) ? (var_1_18 == ((float) (var_1_15 + 64.4f))) : 1)) && ((var_1_17 && var_1_20) ? (var_1_17 ? (var_1_19 == ((signed short int) ((var_1_16 - var_1_24) + 50))) : (var_1_19 == ((signed short int) ((((var_1_24) > (var_1_16)) ? (var_1_24) : (var_1_16)))))) : (((var_1_1 * (- var_1_5)) < (var_1_6 - var_1_7)) ? ((var_1_14 == var_1_8) ? (var_1_19 == ((signed short int) var_1_16)) : (var_1_19 == ((signed short int) (var_1_16 + var_1_24)))) : (var_1_19 == ((signed short int) ((var_1_16 + var_1_24) + 16)))))) && ((! var_1_20) ? ((last_1_var_1_16 <= last_1_var_1_16) ? (var_1_24 == ((unsigned char) ((var_1_25 + 1) + var_1_26))) : (var_1_24 == ((unsigned char) var_1_26))) : (var_1_24 == ((unsigned char) var_1_26)))) && ((((((var_1_24) < (var_1_24)) ? (var_1_24) : (var_1_24))) < var_1_25) ? (((var_1_20 || var_1_17) && var_1_28) ? (var_1_27 == ((signed short int) (((((((((var_1_24) > (var_1_24)) ? (var_1_24) : (var_1_24))) + last_1_var_1_27)) < (((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26))))) ? ((((((var_1_24) > (var_1_24)) ? (var_1_24) : (var_1_24))) + last_1_var_1_27)) : (((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))))))) : 1) : 1)) && (var_1_29 == ((float) (var_1_6 + ((var_1_30 - 7.6f) - var_1_7))))) && (var_1_31 == ((unsigned long int) ((((((var_1_11 + var_1_32)) > (var_1_33)) ? ((var_1_11 + var_1_32)) : (var_1_33))) - var_1_26)))) && (((~ var_1_16) > var_1_31) ? (((var_1_24 / var_1_11) >= var_1_26) ? (var_1_34 == ((double) ((((((-5.2001036938992108E18) < 0 ) ? -(-5.2001036938992108E18) : (-5.2001036938992108E18))) - 50.25) - var_1_4))) : (var_1_34 == ((double) var_1_7))) : 1) ; [L193] RET, EXPR property() [L193] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=80, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_31=4294967231, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=80, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=-255, var_1_31=4294967231, var_1_32=1073741824, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 5, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 347 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 347 mSDsluCounter, 1311 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 774 mSDsCounter, 166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 343 IncrementalHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 166 mSolverCounterUnsat, 537 mSDtfsCounter, 343 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=4, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 162 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 900 NumberOfCodeBlocks, 900 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 596 ConstructedInterpolants, 0 QuantifiedInterpolants, 1047 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 4048/4048 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 11:22:19,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-84.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 551891823d05010aa1b34702044285dbd006dd782691a051b6d02a0f9d69b6f6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:22:21,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:22:21,583 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:22:21,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:22:21,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:22:21,628 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:22:21,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:22:21,629 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:22:21,631 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:22:21,633 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:22:21,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:22:21,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:22:21,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:22:21,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:22:21,638 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:22:21,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:22:21,639 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:22:21,639 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:22:21,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:22:21,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:22:21,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:22:21,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:22:21,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:22:21,641 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:22:21,641 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:22:21,641 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:22:21,641 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:22:21,642 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:22:21,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:22:21,642 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:22:21,642 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:22:21,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:22:21,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:22:21,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:22:21,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:22:21,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:22:21,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:22:21,646 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:22:21,647 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:22:21,647 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:22:21,647 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:22:21,647 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:22:21,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:22:21,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:22:21,648 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:22:21,649 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 551891823d05010aa1b34702044285dbd006dd782691a051b6d02a0f9d69b6f6 [2024-10-11 11:22:22,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:22:22,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:22:22,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:22:22,031 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:22:22,033 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:22:22,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-84.i [2024-10-11 11:22:23,660 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:22:23,907 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:22:23,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-84.i [2024-10-11 11:22:23,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ff2fdc410/f02bd1d28b0549259e7701e5c93b3cfe/FLAG5598270cd [2024-10-11 11:22:23,955 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ff2fdc410/f02bd1d28b0549259e7701e5c93b3cfe [2024-10-11 11:22:23,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:22:23,960 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:22:23,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:22:23,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:22:23,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:22:23,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:22:23" (1/1) ... [2024-10-11 11:22:23,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c9ff6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:23, skipping insertion in model container [2024-10-11 11:22:23,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:22:23" (1/1) ... [2024-10-11 11:22:24,010 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:22:24,230 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-while_file-84.i[916,929] [2024-10-11 11:22:24,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:22:24,354 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:22:24,368 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-while_file-84.i[916,929] [2024-10-11 11:22:24,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:22:24,456 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:22:24,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:24 WrapperNode [2024-10-11 11:22:24,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:22:24,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:22:24,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:22:24,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:22:24,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:24" (1/1) ... [2024-10-11 11:22:24,483 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:24" (1/1) ... [2024-10-11 11:22:24,522 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2024-10-11 11:22:24,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:22:24,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:22:24,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:22:24,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:22:24,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:24" (1/1) ... [2024-10-11 11:22:24,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:24" (1/1) ... [2024-10-11 11:22:24,541 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:24" (1/1) ... [2024-10-11 11:22:24,566 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:22:24,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:24" (1/1) ... [2024-10-11 11:22:24,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:24" (1/1) ... [2024-10-11 11:22:24,587 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:24" (1/1) ... [2024-10-11 11:22:24,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:24" (1/1) ... [2024-10-11 11:22:24,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:24" (1/1) ... [2024-10-11 11:22:24,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:24" (1/1) ... [2024-10-11 11:22:24,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:22:24,620 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:22:24,623 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:22:24,623 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:22:24,625 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:24" (1/1) ... [2024-10-11 11:22:24,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:22:24,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:22:24,664 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:22:24,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:22:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:22:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:22:24,717 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:22:24,717 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:22:24,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:22:24,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:22:24,806 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:22:24,809 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:22:38,417 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-11 11:22:38,417 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:22:38,475 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:22:38,476 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:22:38,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:22:38 BoogieIcfgContainer [2024-10-11 11:22:38,476 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:22:38,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:22:38,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:22:38,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:22:38,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:22:23" (1/3) ... [2024-10-11 11:22:38,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7ffbc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:22:38, skipping insertion in model container [2024-10-11 11:22:38,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:22:24" (2/3) ... [2024-10-11 11:22:38,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7ffbc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:22:38, skipping insertion in model container [2024-10-11 11:22:38,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:22:38" (3/3) ... [2024-10-11 11:22:38,490 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-84.i [2024-10-11 11:22:38,516 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:22:38,516 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:22:38,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:22:38,600 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;@6a2e683c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:22:38,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:22:38,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 11:22:38,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 11:22:38,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:22:38,619 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:22:38,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:22:38,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:22:38,626 INFO L85 PathProgramCache]: Analyzing trace with hash 821173520, now seen corresponding path program 1 times [2024-10-11 11:22:38,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:22:38,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128664496] [2024-10-11 11:22:38,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:22:38,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:22:38,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:22:38,643 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:22:38,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 11:22:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:39,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 11:22:39,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:22:39,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 11:22:39,709 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:22:39,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:22:39,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128664496] [2024-10-11 11:22:39,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128664496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:22:39,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:22:39,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:22:39,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071205634] [2024-10-11 11:22:39,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:22:39,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:22:39,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:22:39,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:22:39,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:22:39,751 INFO L87 Difference]: Start difference. First operand has 74 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 11:22:45,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:22:50,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:22:54,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:22:54,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:22:54,045 INFO L93 Difference]: Finished difference Result 145 states and 255 transitions. [2024-10-11 11:22:54,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:22:54,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 150 [2024-10-11 11:22:54,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:22:54,148 INFO L225 Difference]: With dead ends: 145 [2024-10-11 11:22:54,149 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 11:22:54,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:22:54,155 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:22:54,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 196 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 2 Unknown, 0 Unchecked, 14.2s Time] [2024-10-11 11:22:54,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 11:22:54,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-11 11:22:54,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 11:22:54,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 110 transitions. [2024-10-11 11:22:54,208 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 110 transitions. Word has length 150 [2024-10-11 11:22:54,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:22:54,210 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 110 transitions. [2024-10-11 11:22:54,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 11:22:54,211 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 110 transitions. [2024-10-11 11:22:54,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 11:22:54,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:22:54,217 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:22:54,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 11:22:54,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:22:54,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:22:54,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:22:54,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1407979534, now seen corresponding path program 1 times [2024-10-11 11:22:54,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:22:54,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427155980] [2024-10-11 11:22:54,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:22:54,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:22:54,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:22:54,428 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:22:54,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 11:22:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:22:55,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 11:22:55,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:22:57,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 508 proven. 39 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-10-11 11:22:57,790 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:22:59,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 11:22:59,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:22:59,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427155980] [2024-10-11 11:22:59,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427155980] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 11:22:59,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:22:59,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2024-10-11 11:22:59,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837779655] [2024-10-11 11:22:59,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:22:59,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:22:59,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:22:59,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:22:59,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:22:59,062 INFO L87 Difference]: Start difference. First operand 72 states and 110 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 11:23:03,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:23:07,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:23:11,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:23:15,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:23:19,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:23:19,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:23:19,869 INFO L93 Difference]: Finished difference Result 177 states and 267 transitions. [2024-10-11 11:23:19,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:23:19,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 150 [2024-10-11 11:23:19,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:23:19,878 INFO L225 Difference]: With dead ends: 177 [2024-10-11 11:23:19,879 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 11:23:19,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:23:19,880 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 44 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2024-10-11 11:23:19,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 357 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 20.7s Time] [2024-10-11 11:23:19,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 11:23:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2024-10-11 11:23:19,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 70 states have internal predecessors, (93), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 11:23:19,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 155 transitions. [2024-10-11 11:23:19,933 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 155 transitions. Word has length 150 [2024-10-11 11:23:19,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:23:19,937 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 155 transitions. [2024-10-11 11:23:19,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 11:23:19,938 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 155 transitions. [2024-10-11 11:23:19,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 11:23:19,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:23:19,946 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:23:19,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 11:23:20,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:23:20,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:23:20,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:23:20,148 INFO L85 PathProgramCache]: Analyzing trace with hash 376140806, now seen corresponding path program 1 times [2024-10-11 11:23:20,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:23:20,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438020342] [2024-10-11 11:23:20,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:20,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:23:20,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:23:20,152 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:23:20,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 11:23:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:21,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 11:23:21,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:23:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-10-11 11:23:27,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:23:29,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:23:29,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438020342] [2024-10-11 11:23:29,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438020342] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:23:29,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [464400788] [2024-10-11 11:23:29,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:29,937 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 11:23:29,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 11:23:29,939 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 11:23:29,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-11 11:23:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:33,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 11:23:33,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:23:39,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-10-11 11:23:39,055 INFO L311 TraceCheckSpWp]: Computing backward predicates...