./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-27.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 50be18fcf69a7c1dbc1c561b7fb19ea5d9f8670f998b213ac5992856b4ad08c0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:45:00,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:45:00,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:45:00,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:45:00,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:45:00,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:45:00,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:45:00,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:45:00,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:45:00,934 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:45:00,935 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:45:00,936 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:45:00,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:45:00,937 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:45:00,938 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:45:00,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:45:00,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:45:00,939 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:45:00,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:45:00,940 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:45:00,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:45:00,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:45:00,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:45:00,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:45:00,944 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:45:00,944 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:45:00,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:45:00,945 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:45:00,945 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:45:00,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:45:00,945 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:45:00,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:45:00,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:45:00,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:45:00,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:45:00,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:45:00,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:45:00,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:45:00,948 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:45:00,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:45:00,949 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:45:00,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:45:00,949 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 50be18fcf69a7c1dbc1c561b7fb19ea5d9f8670f998b213ac5992856b4ad08c0 [2024-10-13 03:45:01,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:45:01,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:45:01,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:45:01,228 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:45:01,229 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:45:01,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-27.i [2024-10-13 03:45:02,653 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:45:02,912 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:45:02,913 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-27.i [2024-10-13 03:45:02,925 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0573080c/1e6b938fbf8643c2a9c9c13d1f0372a4/FLAGef1fd0525 [2024-10-13 03:45:02,944 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0573080c/1e6b938fbf8643c2a9c9c13d1f0372a4 [2024-10-13 03:45:02,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:45:02,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:45:02,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:45:02,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:45:02,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:45:02,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:45:02" (1/1) ... [2024-10-13 03:45:02,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@476be2c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:02, skipping insertion in model container [2024-10-13 03:45:02,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:45:02" (1/1) ... [2024-10-13 03:45:02,997 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:45:03,177 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-27.i[916,929] [2024-10-13 03:45:03,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:45:03,266 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:45:03,280 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-27.i[916,929] [2024-10-13 03:45:03,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:45:03,367 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:45:03,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:03 WrapperNode [2024-10-13 03:45:03,368 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:45:03,369 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:45:03,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:45:03,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:45:03,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:03" (1/1) ... [2024-10-13 03:45:03,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:03" (1/1) ... [2024-10-13 03:45:03,452 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 218 [2024-10-13 03:45:03,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:45:03,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:45:03,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:45:03,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:45:03,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:03" (1/1) ... [2024-10-13 03:45:03,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:03" (1/1) ... [2024-10-13 03:45:03,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:03" (1/1) ... [2024-10-13 03:45:03,516 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 03:45:03,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:03" (1/1) ... [2024-10-13 03:45:03,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:03" (1/1) ... [2024-10-13 03:45:03,531 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:03" (1/1) ... [2024-10-13 03:45:03,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:03" (1/1) ... [2024-10-13 03:45:03,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:03" (1/1) ... [2024-10-13 03:45:03,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:03" (1/1) ... [2024-10-13 03:45:03,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:45:03,556 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:45:03,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:45:03,556 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:45:03,557 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:03" (1/1) ... [2024-10-13 03:45:03,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:45:03,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:45:03,598 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:45:03,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:45:03,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:45:03,641 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:45:03,641 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:45:03,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:45:03,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:45:03,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:45:03,721 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:45:03,723 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:45:04,274 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-13 03:45:04,275 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:45:04,305 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:45:04,305 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:45:04,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:45:04 BoogieIcfgContainer [2024-10-13 03:45:04,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:45:04,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:45:04,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:45:04,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:45:04,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:45:02" (1/3) ... [2024-10-13 03:45:04,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f0ef59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:45:04, skipping insertion in model container [2024-10-13 03:45:04,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:03" (2/3) ... [2024-10-13 03:45:04,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f0ef59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:45:04, skipping insertion in model container [2024-10-13 03:45:04,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:45:04" (3/3) ... [2024-10-13 03:45:04,315 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-27.i [2024-10-13 03:45:04,331 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:45:04,332 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:45:04,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:45:04,407 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;@58bafa44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:45:04,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:45:04,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 60 states have internal predecessors, (87), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:45:04,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-13 03:45:04,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:45:04,431 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:45:04,432 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:45:04,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:45:04,436 INFO L85 PathProgramCache]: Analyzing trace with hash 323263946, now seen corresponding path program 1 times [2024-10-13 03:45:04,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:45:04,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228103180] [2024-10-13 03:45:04,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:45:04,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:45:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:45:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:45:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:45:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:45:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:45:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:45:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:45:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:45:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:45:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:45:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 03:45:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:45:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:45:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:45:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:45:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:45:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:45:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:45:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:45:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:45:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:45:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 03:45:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:45:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:04,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 03:45:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 03:45:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 03:45:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 03:45:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:45:05,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:45:05,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228103180] [2024-10-13 03:45:05,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228103180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:45:05,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:45:05,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:45:05,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066065385] [2024-10-13 03:45:05,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:45:05,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:45:05,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:45:05,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:45:05,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:45:05,062 INFO L87 Difference]: Start difference. First operand has 89 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 60 states have internal predecessors, (87), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 03:45:05,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:45:05,106 INFO L93 Difference]: Finished difference Result 177 states and 308 transitions. [2024-10-13 03:45:05,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:45:05,110 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 176 [2024-10-13 03:45:05,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:45:05,119 INFO L225 Difference]: With dead ends: 177 [2024-10-13 03:45:05,120 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 03:45:05,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:45:05,131 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:45:05,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:45:05,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 03:45:05,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-13 03:45:05,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:45:05,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 135 transitions. [2024-10-13 03:45:05,186 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 135 transitions. Word has length 176 [2024-10-13 03:45:05,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:45:05,186 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 135 transitions. [2024-10-13 03:45:05,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 03:45:05,187 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 135 transitions. [2024-10-13 03:45:05,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-13 03:45:05,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:45:05,191 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:45:05,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:45:05,191 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:45:05,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:45:05,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2118392209, now seen corresponding path program 1 times [2024-10-13 03:45:05,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:45:05,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588556265] [2024-10-13 03:45:05,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:45:05,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:45:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:45:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:45:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:45:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:45:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:45:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:45:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:45:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:45:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:45:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:45:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 03:45:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:45:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:45:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:45:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:45:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:45:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:45:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:45:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:45:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:45:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:45:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 03:45:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:45:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 03:45:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 03:45:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 03:45:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 03:45:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:45:05,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:45:05,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588556265] [2024-10-13 03:45:05,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588556265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:45:05,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:45:05,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:45:05,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176900494] [2024-10-13 03:45:05,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:45:05,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:45:05,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:45:05,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:45:05,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:45:05,573 INFO L87 Difference]: Start difference. First operand 87 states and 135 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:45:05,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:45:05,733 INFO L93 Difference]: Finished difference Result 255 states and 395 transitions. [2024-10-13 03:45:05,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:45:05,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2024-10-13 03:45:05,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:45:05,741 INFO L225 Difference]: With dead ends: 255 [2024-10-13 03:45:05,742 INFO L226 Difference]: Without dead ends: 169 [2024-10-13 03:45:05,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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-13 03:45:05,744 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 125 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:45:05,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 267 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:45:05,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-13 03:45:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 98. [2024-10-13 03:45:05,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 69 states have internal predecessors, (95), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:45:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 149 transitions. [2024-10-13 03:45:05,767 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 149 transitions. Word has length 177 [2024-10-13 03:45:05,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:45:05,769 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 149 transitions. [2024-10-13 03:45:05,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:45:05,770 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 149 transitions. [2024-10-13 03:45:05,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-13 03:45:05,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:45:05,772 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:45:05,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:45:05,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:45:05,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:45:05,773 INFO L85 PathProgramCache]: Analyzing trace with hash -466127719, now seen corresponding path program 1 times [2024-10-13 03:45:05,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:45:05,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391766285] [2024-10-13 03:45:05,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:45:05,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:45:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:06,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:45:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:06,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:45:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:06,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:45:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:06,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:45:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:06,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:45:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:06,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:45:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:06,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:45:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:06,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:45:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:06,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:45:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:06,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:45:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:06,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 03:45:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:06,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:45:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:06,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:45:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:06,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:45:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:07,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:45:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:07,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:45:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:07,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:45:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:07,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:45:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:07,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:45:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:07,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:45:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:07,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:45:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:07,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 03:45:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:07,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 03:45:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:07,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 03:45:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:07,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 03:45:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:07,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 03:45:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:07,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 03:45:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 39 proven. 39 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-13 03:45:07,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:45:07,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391766285] [2024-10-13 03:45:07,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391766285] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:45:07,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092719471] [2024-10-13 03:45:07,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:45:07,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:45:07,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:45:07,120 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 03:45:07,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 03:45:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:07,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 03:45:07,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:45:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 743 proven. 72 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-10-13 03:45:08,002 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:45:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 39 proven. 39 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-13 03:45:08,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092719471] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 03:45:08,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 03:45:08,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 17 [2024-10-13 03:45:08,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885103598] [2024-10-13 03:45:08,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 03:45:08,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 03:45:08,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:45:08,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 03:45:08,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-13 03:45:08,457 INFO L87 Difference]: Start difference. First operand 98 states and 149 transitions. Second operand has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 4 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) [2024-10-13 03:45:09,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:45:09,280 INFO L93 Difference]: Finished difference Result 256 states and 380 transitions. [2024-10-13 03:45:09,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 03:45:09,280 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 4 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) Word has length 178 [2024-10-13 03:45:09,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:45:09,283 INFO L225 Difference]: With dead ends: 256 [2024-10-13 03:45:09,283 INFO L226 Difference]: Without dead ends: 159 [2024-10-13 03:45:09,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2024-10-13 03:45:09,289 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 452 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 03:45:09,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 551 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 03:45:09,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-13 03:45:09,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 152. [2024-10-13 03:45:09,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 108 states have internal predecessors, (144), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 03:45:09,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 224 transitions. [2024-10-13 03:45:09,318 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 224 transitions. Word has length 178 [2024-10-13 03:45:09,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:45:09,319 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 224 transitions. [2024-10-13 03:45:09,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 17 states have internal predecessors, (104), 4 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) [2024-10-13 03:45:09,323 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 224 transitions. [2024-10-13 03:45:09,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-13 03:45:09,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:45:09,330 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:45:09,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 03:45:09,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:45:09,531 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:45:09,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:45:09,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1052933733, now seen corresponding path program 1 times [2024-10-13 03:45:09,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:45:09,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5673276] [2024-10-13 03:45:09,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:45:09,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:45:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 03:45:09,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [79458728] [2024-10-13 03:45:09,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:45:09,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:45:09,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:45:09,759 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 03:45:09,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 03:45:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:09,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 03:45:09,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:45:10,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 173 proven. 195 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2024-10-13 03:45:10,450 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:45:10,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 3 proven. 150 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2024-10-13 03:45:10,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:45:10,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5673276] [2024-10-13 03:45:10,800 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 03:45:10,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79458728] [2024-10-13 03:45:10,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79458728] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 03:45:10,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 03:45:10,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2024-10-13 03:45:10,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466970768] [2024-10-13 03:45:10,802 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 03:45:10,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 03:45:10,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:45:10,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 03:45:10,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2024-10-13 03:45:10,804 INFO L87 Difference]: Start difference. First operand 152 states and 224 transitions. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 4 states have call successors, (53), 3 states have call predecessors, (53), 8 states have return successors, (54), 3 states have call predecessors, (54), 4 states have call successors, (54) [2024-10-13 03:45:11,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:45:11,391 INFO L93 Difference]: Finished difference Result 323 states and 463 transitions. [2024-10-13 03:45:11,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 03:45:11,392 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 4 states have call successors, (53), 3 states have call predecessors, (53), 8 states have return successors, (54), 3 states have call predecessors, (54), 4 states have call successors, (54) Word has length 178 [2024-10-13 03:45:11,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:45:11,396 INFO L225 Difference]: With dead ends: 323 [2024-10-13 03:45:11,396 INFO L226 Difference]: Without dead ends: 172 [2024-10-13 03:45:11,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 338 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2024-10-13 03:45:11,398 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 124 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 03:45:11,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 429 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 03:45:11,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-13 03:45:11,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2024-10-13 03:45:11,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 119 states have (on average 1.3025210084033614) internal successors, (155), 120 states have internal predecessors, (155), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 03:45:11,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 235 transitions. [2024-10-13 03:45:11,422 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 235 transitions. Word has length 178 [2024-10-13 03:45:11,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:45:11,422 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 235 transitions. [2024-10-13 03:45:11,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 4 states have call successors, (53), 3 states have call predecessors, (53), 8 states have return successors, (54), 3 states have call predecessors, (54), 4 states have call successors, (54) [2024-10-13 03:45:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 235 transitions. [2024-10-13 03:45:11,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-13 03:45:11,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:45:11,425 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:45:11,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 03:45:11,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-13 03:45:11,627 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:45:11,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:45:11,628 INFO L85 PathProgramCache]: Analyzing trace with hash -990894119, now seen corresponding path program 1 times [2024-10-13 03:45:11,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:45:11,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809362431] [2024-10-13 03:45:11,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:45:11,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:45:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 03:45:11,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [716701459] [2024-10-13 03:45:11,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:45:11,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:45:11,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:45:11,861 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 03:45:11,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 03:45:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:45:12,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:45:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:45:12,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:45:12,544 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:45:12,545 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:45:12,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 03:45:12,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:45:12,752 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-13 03:45:12,913 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:45:12,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:45:12 BoogieIcfgContainer [2024-10-13 03:45:12,917 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:45:12,918 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:45:12,918 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:45:12,918 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:45:12,919 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:45:04" (3/4) ... [2024-10-13 03:45:12,920 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:45:12,922 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:45:12,923 INFO L158 Benchmark]: Toolchain (without parser) took 9973.60ms. Allocated memory was 146.8MB in the beginning and 245.4MB in the end (delta: 98.6MB). Free memory was 99.6MB in the beginning and 199.0MB in the end (delta: -99.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:45:12,923 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 146.8MB. Free memory is still 111.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:45:12,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.45ms. Allocated memory is still 146.8MB. Free memory was 99.6MB in the beginning and 82.2MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 03:45:12,924 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.54ms. Allocated memory is still 146.8MB. Free memory was 82.2MB in the beginning and 76.5MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 03:45:12,924 INFO L158 Benchmark]: Boogie Preprocessor took 101.16ms. Allocated memory is still 146.8MB. Free memory was 76.5MB in the beginning and 69.0MB in the end (delta: 7.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 03:45:12,925 INFO L158 Benchmark]: RCFGBuilder took 750.27ms. Allocated memory was 146.8MB in the beginning and 203.4MB in the end (delta: 56.6MB). Free memory was 69.0MB in the beginning and 167.2MB in the end (delta: -98.2MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. [2024-10-13 03:45:12,926 INFO L158 Benchmark]: TraceAbstraction took 8609.07ms. Allocated memory was 203.4MB in the beginning and 245.4MB in the end (delta: 41.9MB). Free memory was 167.2MB in the beginning and 199.0MB in the end (delta: -31.9MB). Peak memory consumption was 141.2MB. Max. memory is 16.1GB. [2024-10-13 03:45:12,926 INFO L158 Benchmark]: Witness Printer took 3.79ms. Allocated memory is still 245.4MB. Free memory is still 199.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:45:12,927 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 146.8MB. Free memory is still 111.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.45ms. Allocated memory is still 146.8MB. Free memory was 99.6MB in the beginning and 82.2MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.54ms. Allocated memory is still 146.8MB. Free memory was 82.2MB in the beginning and 76.5MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.16ms. Allocated memory is still 146.8MB. Free memory was 76.5MB in the beginning and 69.0MB in the end (delta: 7.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 750.27ms. Allocated memory was 146.8MB in the beginning and 203.4MB in the end (delta: 56.6MB). Free memory was 69.0MB in the beginning and 167.2MB in the end (delta: -98.2MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8609.07ms. Allocated memory was 203.4MB in the beginning and 245.4MB in the end (delta: 41.9MB). Free memory was 167.2MB in the beginning and 199.0MB in the end (delta: -31.9MB). Peak memory consumption was 141.2MB. Max. memory is 16.1GB. * Witness Printer took 3.79ms. Allocated memory is still 245.4MB. Free memory is still 199.0MB. 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 someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of someUnaryDOUBLEoperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] signed char var_1_3 = 25; [L24] signed char var_1_4 = 10; [L25] signed char var_1_5 = -10; [L26] signed char var_1_6 = -1; [L27] signed short int var_1_7 = -4; [L28] signed char var_1_8 = 50; [L29] signed short int var_1_9 = 2; [L30] unsigned long int var_1_10 = 128; [L31] unsigned char var_1_11 = 2; [L32] unsigned long int var_1_12 = 2781423228; [L33] unsigned long int var_1_13 = 3552320529; [L34] double var_1_14 = 2.25; [L35] unsigned char var_1_15 = 5; [L36] unsigned char var_1_16 = 64; [L37] double var_1_17 = 9.48; [L38] double var_1_18 = 256.05; [L39] float var_1_19 = 1.1; [L40] float var_1_21 = 16.5; [L41] float var_1_22 = 9.4; [L42] unsigned short int var_1_23 = 100; [L43] unsigned char var_1_24 = 5; [L44] unsigned short int var_1_25 = 4; [L45] unsigned short int var_1_26 = 48215; [L46] unsigned short int var_1_27 = 10; [L47] unsigned short int var_1_28 = 1; [L48] signed char var_1_29 = 0; [L49] unsigned long int var_1_30 = 1524073358; [L50] unsigned char var_1_31 = 1; [L51] double var_1_32 = 64.45; [L186] isInitial = 1 [L187] FCALL initially() [L188] int k_loop; [L189] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=25, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L189] COND TRUE k_loop < 1 [L190] FCALL updateLastVariables() [L191] CALL updateVariables() [L136] var_1_3 = __VERIFIER_nondet_char() [L137] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L137] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L138] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L138] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L139] var_1_4 = __VERIFIER_nondet_char() [L140] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L140] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L141] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L141] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L142] var_1_5 = __VERIFIER_nondet_char() [L143] CALL assume_abort_if_not(var_1_5 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L143] RET assume_abort_if_not(var_1_5 >= -63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L144] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L144] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L145] var_1_6 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_6 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L146] RET assume_abort_if_not(var_1_6 >= -63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L147] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L147] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L148] var_1_11 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L149] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L150] CALL assume_abort_if_not(var_1_11 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L150] RET assume_abort_if_not(var_1_11 <= 255) VAL [isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L151] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L151] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L152] var_1_12 = __VERIFIER_nondet_ulong() [L153] CALL assume_abort_if_not(var_1_12 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L153] RET assume_abort_if_not(var_1_12 >= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L154] CALL assume_abort_if_not(var_1_12 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L154] RET assume_abort_if_not(var_1_12 <= 4294967294) VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L155] var_1_13 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_13 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L156] RET assume_abort_if_not(var_1_13 >= 3221225470) VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L157] CALL assume_abort_if_not(var_1_13 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L157] RET assume_abort_if_not(var_1_13 <= 4294967294) VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L158] var_1_15 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L159] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L160] CALL assume_abort_if_not(var_1_15 <= 128) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L160] RET assume_abort_if_not(var_1_15 <= 128) VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L161] var_1_16 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L162] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L163] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L163] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L164] var_1_17 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L165] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L166] var_1_18 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L167] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L168] var_1_21 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L169] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L170] var_1_22 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L171] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L172] var_1_26 = __VERIFIER_nondet_ushort() [L173] CALL assume_abort_if_not(var_1_26 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L173] RET assume_abort_if_not(var_1_26 >= 32767) VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L174] CALL assume_abort_if_not(var_1_26 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L174] RET assume_abort_if_not(var_1_26 <= 65534) VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L175] var_1_30 = __VERIFIER_nondet_ulong() [L176] CALL assume_abort_if_not(var_1_30 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L176] RET assume_abort_if_not(var_1_30 >= 1073741823) VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L177] CALL assume_abort_if_not(var_1_30 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L177] RET assume_abort_if_not(var_1_30 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=-4, var_1_8=50, var_1_9=2] [L191] RET updateVariables() [L192] CALL step() [L55] var_1_7 = ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))) [L56] signed long int stepLocal_0 = 128 - 256; VAL [isInitial=1, stepLocal_0=-128, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=50, var_1_9=2] [L57] COND FALSE !((var_1_4 * var_1_3) < stepLocal_0) [L60] var_1_8 = -16 VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=-16, var_1_9=2] [L62] var_1_9 = var_1_6 [L63] signed char stepLocal_4 = var_1_4; VAL [isInitial=1, stepLocal_4=0, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=-16, var_1_9=63] [L64] COND TRUE var_1_12 >= stepLocal_4 [L65] var_1_23 = var_1_16 VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_23=2, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=-16, var_1_9=63] [L67] var_1_24 = (var_1_16 + var_1_3) VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_23=2, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=-16, var_1_9=63] [L68] COND TRUE var_1_8 != (var_1_11 + var_1_5) [L69] var_1_27 = var_1_15 VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_19=11/10, var_1_1=32, var_1_23=2, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=11, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=1, var_1_32=1289/20, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=-16, var_1_9=63] [L71] var_1_31 = 0 [L72] var_1_32 = var_1_17 VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_17=2, var_1_19=11/10, var_1_1=32, var_1_23=2, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=11, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=-16, var_1_9=63] [L73] COND FALSE !(! (! var_1_31)) VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_17=2, var_1_19=11/10, var_1_1=32, var_1_23=2, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=11, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=-16, var_1_9=63] [L76] COND FALSE !(\read(var_1_31)) [L79] var_1_1 = var_1_4 VAL [isInitial=1, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_17=2, var_1_19=11/10, var_1_1=0, var_1_23=2, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=11, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=-16, var_1_9=63] [L82] signed long int stepLocal_1 = (var_1_9 * 128) / var_1_11; VAL [isInitial=1, stepLocal_1=620, var_1_10=128, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_17=2, var_1_19=11/10, var_1_1=0, var_1_23=2, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=11, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=-16, var_1_9=63] [L83] COND FALSE !(\read(var_1_31)) [L90] var_1_10 = var_1_13 VAL [isInitial=1, stepLocal_1=620, var_1_10=11811160062, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_17=2, var_1_19=11/10, var_1_1=0, var_1_23=2, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=11, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=-16, var_1_9=63] [L92] signed long int stepLocal_2 = (- var_1_11) / (var_1_15 + var_1_16); VAL [isInitial=1, stepLocal_1=620, stepLocal_2=-1, var_1_10=11811160062, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=9/4, var_1_15=11, var_1_16=514, var_1_17=2, var_1_19=11/10, var_1_1=0, var_1_23=2, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=11, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=-16, var_1_9=63] [L93] COND TRUE stepLocal_2 <= var_1_3 [L94] var_1_14 = ((((((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) > (var_1_18)) ? (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) : (var_1_18))) VAL [isInitial=1, stepLocal_1=620, var_1_10=11811160062, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=3, var_1_15=11, var_1_16=514, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=0, var_1_23=2, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=11, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=-16, var_1_9=63] [L100] unsigned long int stepLocal_5 = var_1_13; VAL [isInitial=1, stepLocal_1=620, stepLocal_5=11811160062, var_1_10=11811160062, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=3, var_1_15=11, var_1_16=514, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=0, var_1_23=2, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=11, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=-16, var_1_9=63] [L101] COND FALSE !((~ var_1_10) >= stepLocal_5) VAL [isInitial=1, stepLocal_1=620, var_1_10=11811160062, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=3, var_1_15=11, var_1_16=514, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=0, var_1_23=2, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=11, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=-16, var_1_9=63] [L104] COND TRUE -16 <= var_1_27 VAL [isInitial=1, stepLocal_1=620, var_1_10=11811160062, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=3, var_1_15=11, var_1_16=514, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=0, var_1_23=2, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=11, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=-16, var_1_9=63] [L105] COND FALSE !(var_1_5 == var_1_28) VAL [isInitial=1, stepLocal_1=620, var_1_10=11811160062, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=3, var_1_15=11, var_1_16=514, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=0, var_1_23=2, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=11, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=-16, var_1_9=63] [L111] unsigned long int stepLocal_3 = var_1_10; VAL [isInitial=1, stepLocal_1=620, stepLocal_3=11811160062, var_1_10=11811160062, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=3, var_1_15=11, var_1_16=514, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=0, var_1_23=2, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=11, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=-16, var_1_9=63] [L112] COND FALSE !(\read(var_1_31)) [L119] var_1_19 = var_1_22 VAL [isInitial=1, stepLocal_1=620, stepLocal_3=11811160062, var_1_10=11811160062, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=3, var_1_15=11, var_1_16=514, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=0, var_1_22=4, var_1_23=2, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=11, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=-16, var_1_9=63] [L121] EXPR (var_1_6 / var_1_11) | var_1_5 VAL [isInitial=1, stepLocal_1=620, stepLocal_3=11811160062, var_1_10=11811160062, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=3, var_1_15=11, var_1_16=514, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=0, var_1_22=4, var_1_23=2, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=11, var_1_28=1, var_1_29=0, var_1_30=10730336934, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=-16, var_1_9=63] [L121] COND TRUE (var_1_16 + var_1_3) < ((var_1_6 / var_1_11) | var_1_5) [L122] COND TRUE (3214144168u - (var_1_30 - var_1_10)) != (- var_1_27) [L123] var_1_29 = (((((var_1_3 + var_1_5)) > (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) ? ((var_1_3 + var_1_5)) : (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))))) VAL [isInitial=1, stepLocal_1=620, stepLocal_3=11811160062, var_1_10=11811160062, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=3, var_1_15=11, var_1_16=514, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=0, var_1_22=4, var_1_23=2, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=11, var_1_28=1, var_1_29=63, var_1_30=10730336934, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=-16, var_1_9=63] [L192] RET step() [L193] CALL, EXPR property() [L182] EXPR (((((((((((((! (! var_1_31)) ? (var_1_1 == ((signed char) ((((((var_1_3 - var_1_4)) > (var_1_5)) ? ((var_1_3 - var_1_4)) : (var_1_5))) + var_1_6))) : (var_1_31 ? (var_1_1 == ((signed char) var_1_3)) : (var_1_1 == ((signed char) var_1_4)))) && (var_1_7 == ((signed short int) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))))) && (((var_1_4 * var_1_3) < (128 - 256)) ? (var_1_8 == ((signed char) (var_1_4 - 4))) : (var_1_8 == ((signed char) -16)))) && (var_1_9 == ((signed short int) var_1_6))) && (var_1_31 ? ((((var_1_9 * 128) / var_1_11) != (((((var_1_4 - var_1_3)) > (var_1_1)) ? ((var_1_4 - var_1_3)) : (var_1_1)))) ? (var_1_10 == ((unsigned long int) (((((var_1_12) < ((var_1_13 - var_1_3))) ? (var_1_12) : ((var_1_13 - var_1_3)))) - var_1_4))) : (var_1_10 == ((unsigned long int) var_1_11))) : (var_1_10 == ((unsigned long int) var_1_13)))) && ((((- var_1_11) / (var_1_15 + var_1_16)) <= var_1_3) ? (var_1_14 == ((double) ((((((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) > (var_1_18)) ? (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) : (var_1_18))))) : (var_1_31 ? (var_1_14 == ((double) var_1_17)) : 1))) && (var_1_31 ? ((var_1_10 < (var_1_15 + (var_1_13 + var_1_25))) ? (var_1_19 == ((float) (var_1_21 - (var_1_22 + 8.25f)))) : (var_1_19 == ((float) var_1_18))) : (var_1_19 == ((float) var_1_22)))) && ((var_1_12 >= var_1_4) ? (var_1_23 == ((unsigned short int) var_1_16)) : 1)) && (var_1_24 == ((unsigned char) (var_1_16 + var_1_3)))) && ((-16 <= var_1_27) ? ((var_1_5 == var_1_28) ? (var_1_25 == ((unsigned short int) ((((var_1_4) > (var_1_8)) ? (var_1_4) : (var_1_8))))) : 1) : (var_1_25 == ((unsigned short int) (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))) - var_1_4))))) && ((var_1_8 != (var_1_11 + var_1_5)) ? (var_1_27 == ((unsigned short int) var_1_15)) : 1)) && (((~ var_1_10) >= var_1_13) ? (var_1_28 == ((unsigned short int) (var_1_26 - var_1_4))) : 1)) && (((var_1_16 + var_1_3) < ((var_1_6 / var_1_11) | var_1_5)) ? (((3214144168u - (var_1_30 - var_1_10)) != (- var_1_27)) ? (var_1_29 == ((signed char) (((((var_1_3 + var_1_5)) > (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) ? ((var_1_3 + var_1_5)) : (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))))))) : 1) : ((((((var_1_19 + var_1_22) < 0 ) ? -(var_1_19 + var_1_22) : (var_1_19 + var_1_22))) < var_1_18) ? ((var_1_22 <= var_1_19) ? (var_1_29 == ((signed char) var_1_4)) : 1) : (var_1_29 == ((signed char) var_1_6)))) VAL [isInitial=1, var_1_10=11811160062, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=3, var_1_15=11, var_1_16=514, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=0, var_1_22=4, var_1_23=2, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=11, var_1_28=1, var_1_29=63, var_1_30=10730336934, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=-16, var_1_9=63] [L182-L183] return (((((((((((((((! (! var_1_31)) ? (var_1_1 == ((signed char) ((((((var_1_3 - var_1_4)) > (var_1_5)) ? ((var_1_3 - var_1_4)) : (var_1_5))) + var_1_6))) : (var_1_31 ? (var_1_1 == ((signed char) var_1_3)) : (var_1_1 == ((signed char) var_1_4)))) && (var_1_7 == ((signed short int) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))))) && (((var_1_4 * var_1_3) < (128 - 256)) ? (var_1_8 == ((signed char) (var_1_4 - 4))) : (var_1_8 == ((signed char) -16)))) && (var_1_9 == ((signed short int) var_1_6))) && (var_1_31 ? ((((var_1_9 * 128) / var_1_11) != (((((var_1_4 - var_1_3)) > (var_1_1)) ? ((var_1_4 - var_1_3)) : (var_1_1)))) ? (var_1_10 == ((unsigned long int) (((((var_1_12) < ((var_1_13 - var_1_3))) ? (var_1_12) : ((var_1_13 - var_1_3)))) - var_1_4))) : (var_1_10 == ((unsigned long int) var_1_11))) : (var_1_10 == ((unsigned long int) var_1_13)))) && ((((- var_1_11) / (var_1_15 + var_1_16)) <= var_1_3) ? (var_1_14 == ((double) ((((((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) > (var_1_18)) ? (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) : (var_1_18))))) : (var_1_31 ? (var_1_14 == ((double) var_1_17)) : 1))) && (var_1_31 ? ((var_1_10 < (var_1_15 + (var_1_13 + var_1_25))) ? (var_1_19 == ((float) (var_1_21 - (var_1_22 + 8.25f)))) : (var_1_19 == ((float) var_1_18))) : (var_1_19 == ((float) var_1_22)))) && ((var_1_12 >= var_1_4) ? (var_1_23 == ((unsigned short int) var_1_16)) : 1)) && (var_1_24 == ((unsigned char) (var_1_16 + var_1_3)))) && ((-16 <= var_1_27) ? ((var_1_5 == var_1_28) ? (var_1_25 == ((unsigned short int) ((((var_1_4) > (var_1_8)) ? (var_1_4) : (var_1_8))))) : 1) : (var_1_25 == ((unsigned short int) (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))) - var_1_4))))) && ((var_1_8 != (var_1_11 + var_1_5)) ? (var_1_27 == ((unsigned short int) var_1_15)) : 1)) && (((~ var_1_10) >= var_1_13) ? (var_1_28 == ((unsigned short int) (var_1_26 - var_1_4))) : 1)) && (((var_1_16 + var_1_3) < ((var_1_6 / var_1_11) | var_1_5)) ? (((3214144168u - (var_1_30 - var_1_10)) != (- var_1_27)) ? (var_1_29 == ((signed char) (((((var_1_3 + var_1_5)) > (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) ? ((var_1_3 + var_1_5)) : (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))))))) : 1) : ((((((var_1_19 + var_1_22) < 0 ) ? -(var_1_19 + var_1_22) : (var_1_19 + var_1_22))) < var_1_18) ? ((var_1_22 <= var_1_19) ? (var_1_29 == ((signed char) var_1_4)) : 1) : (var_1_29 == ((signed char) var_1_6))))) && (var_1_31 == ((unsigned char) 0))) && (var_1_32 == ((double) var_1_17)) ; [L193] RET, EXPR property() [L193] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=11811160062, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=3, var_1_15=11, var_1_16=514, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=0, var_1_22=4, var_1_23=2, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=11, var_1_28=1, var_1_29=63, var_1_30=10730336934, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=-16, var_1_9=63] [L19] reach_error() VAL [isInitial=1, var_1_10=11811160062, var_1_11=13, var_1_12=2147483647, var_1_13=11811160062, var_1_14=3, var_1_15=11, var_1_16=514, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=0, var_1_22=4, var_1_23=2, var_1_24=2, var_1_25=4, var_1_26=32767, var_1_27=11, var_1_28=1, var_1_29=63, var_1_30=10730336934, var_1_31=0, var_1_32=2, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=63, var_1_7=0, var_1_8=-16, var_1_9=63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 5, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 728 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 701 mSDsluCounter, 1379 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 886 mSDsCounter, 156 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1088 IncrementalHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 156 mSolverCounterUnsat, 493 mSDtfsCounter, 1088 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 919 GetRequests, 877 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=4, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 82 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1421 NumberOfCodeBlocks, 1421 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1236 ConstructedInterpolants, 0 QuantifiedInterpolants, 4009 SizeOfPredicates, 7 NumberOfNonLiveVariables, 832 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 9333/9828 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 03:45:12,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-27.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 50be18fcf69a7c1dbc1c561b7fb19ea5d9f8670f998b213ac5992856b4ad08c0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:45:15,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:45:15,247 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:45:15,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:45:15,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:45:15,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:45:15,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:45:15,286 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:45:15,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:45:15,288 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:45:15,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:45:15,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:45:15,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:45:15,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:45:15,290 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:45:15,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:45:15,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:45:15,292 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:45:15,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:45:15,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:45:15,293 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:45:15,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:45:15,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:45:15,297 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:45:15,298 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:45:15,298 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:45:15,298 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:45:15,298 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:45:15,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:45:15,299 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:45:15,299 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:45:15,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:45:15,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:45:15,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:45:15,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:45:15,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:45:15,300 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:45:15,301 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:45:15,301 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:45:15,301 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:45:15,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:45:15,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:45:15,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:45:15,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:45:15,303 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:45:15,303 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 50be18fcf69a7c1dbc1c561b7fb19ea5d9f8670f998b213ac5992856b4ad08c0 [2024-10-13 03:45:15,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:45:15,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:45:15,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:45:15,661 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:45:15,662 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:45:15,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-27.i [2024-10-13 03:45:17,202 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:45:17,460 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:45:17,461 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-27.i [2024-10-13 03:45:17,478 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/930ac2926/ee0255c09ec2499eadea8090a2e63027/FLAGa39e305e9 [2024-10-13 03:45:17,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/930ac2926/ee0255c09ec2499eadea8090a2e63027 [2024-10-13 03:45:17,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:45:17,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:45:17,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:45:17,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:45:17,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:45:17,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:45:17" (1/1) ... [2024-10-13 03:45:17,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17c46677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:17, skipping insertion in model container [2024-10-13 03:45:17,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:45:17" (1/1) ... [2024-10-13 03:45:17,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:45:18,034 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-27.i[916,929] [2024-10-13 03:45:18,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:45:18,145 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:45:18,159 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-27.i[916,929] [2024-10-13 03:45:18,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:45:18,246 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:45:18,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:18 WrapperNode [2024-10-13 03:45:18,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:45:18,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:45:18,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:45:18,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:45:18,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:18" (1/1) ... [2024-10-13 03:45:18,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:18" (1/1) ... [2024-10-13 03:45:18,324 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-10-13 03:45:18,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:45:18,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:45:18,327 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:45:18,327 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:45:18,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:18" (1/1) ... [2024-10-13 03:45:18,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:18" (1/1) ... [2024-10-13 03:45:18,346 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:18" (1/1) ... [2024-10-13 03:45:18,373 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 03:45:18,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:18" (1/1) ... [2024-10-13 03:45:18,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:18" (1/1) ... [2024-10-13 03:45:18,395 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:18" (1/1) ... [2024-10-13 03:45:18,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:18" (1/1) ... [2024-10-13 03:45:18,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:18" (1/1) ... [2024-10-13 03:45:18,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:18" (1/1) ... [2024-10-13 03:45:18,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:45:18,419 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:45:18,419 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:45:18,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:45:18,420 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:18" (1/1) ... [2024-10-13 03:45:18,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:45:18,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:45:18,458 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:45:18,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:45:18,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:45:18,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:45:18,517 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:45:18,517 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:45:18,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:45:18,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:45:18,628 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:45:18,630 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:45:22,172 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-13 03:45:22,173 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:45:22,246 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:45:22,246 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:45:22,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:45:22 BoogieIcfgContainer [2024-10-13 03:45:22,247 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:45:22,249 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:45:22,249 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:45:22,252 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:45:22,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:45:17" (1/3) ... [2024-10-13 03:45:22,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d27c709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:45:22, skipping insertion in model container [2024-10-13 03:45:22,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:45:18" (2/3) ... [2024-10-13 03:45:22,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d27c709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:45:22, skipping insertion in model container [2024-10-13 03:45:22,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:45:22" (3/3) ... [2024-10-13 03:45:22,257 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-27.i [2024-10-13 03:45:22,274 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:45:22,274 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:45:22,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:45:22,355 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;@a65d47f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:45:22,356 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:45:22,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:45:22,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-13 03:45:22,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:45:22,377 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:45:22,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:45:22,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:45:22,385 INFO L85 PathProgramCache]: Analyzing trace with hash 984431059, now seen corresponding path program 1 times [2024-10-13 03:45:22,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:45:22,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126555684] [2024-10-13 03:45:22,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:45:22,403 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:45:22,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:45:22,406 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:45:22,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 03:45:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:22,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:45:22,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:45:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 1076 trivial. 0 not checked. [2024-10-13 03:45:22,896 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:45:22,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:45:22,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126555684] [2024-10-13 03:45:22,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126555684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:45:22,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:45:22,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:45:22,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728704774] [2024-10-13 03:45:22,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:45:22,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:45:22,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:45:22,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:45:22,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:45:22,935 INFO L87 Difference]: Start difference. First operand has 80 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 03:45:25,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:45:25,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:45:25,235 INFO L93 Difference]: Finished difference Result 159 states and 280 transitions. [2024-10-13 03:45:25,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:45:25,241 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 173 [2024-10-13 03:45:25,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:45:25,251 INFO L225 Difference]: With dead ends: 159 [2024-10-13 03:45:25,252 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 03:45:25,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:45:25,260 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:45:25,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 03:45:25,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 03:45:25,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-13 03:45:25,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:45:25,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 121 transitions. [2024-10-13 03:45:25,308 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 121 transitions. Word has length 173 [2024-10-13 03:45:25,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:45:25,309 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 121 transitions. [2024-10-13 03:45:25,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 03:45:25,309 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 121 transitions. [2024-10-13 03:45:25,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-13 03:45:25,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:45:25,313 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:45:25,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 03:45:25,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:45:25,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:45:25,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:45:25,515 INFO L85 PathProgramCache]: Analyzing trace with hash -724324308, now seen corresponding path program 1 times [2024-10-13 03:45:25,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:45:25,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086717016] [2024-10-13 03:45:25,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:45:25,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:45:25,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:45:25,519 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:45:25,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 03:45:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:25,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 03:45:25,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:45:29,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 84 proven. 216 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 03:45:29,867 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:45:31,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:45:31,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086717016] [2024-10-13 03:45:31,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086717016] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:45:31,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2045888570] [2024-10-13 03:45:31,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:45:31,254 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 03:45:31,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 03:45:31,257 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 03:45:31,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-13 03:45:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:31,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 03:45:31,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:45:31,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 03:45:31,945 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:45:31,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2045888570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:45:31,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 03:45:31,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2024-10-13 03:45:31,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226136956] [2024-10-13 03:45:31,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:45:31,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:45:31,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:45:31,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:45:31,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-10-13 03:45:31,948 INFO L87 Difference]: Start difference. First operand 78 states and 121 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:45:34,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:45:34,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:45:34,273 INFO L93 Difference]: Finished difference Result 228 states and 353 transitions. [2024-10-13 03:45:34,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:45:34,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2024-10-13 03:45:34,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:45:34,278 INFO L225 Difference]: With dead ends: 228 [2024-10-13 03:45:34,278 INFO L226 Difference]: Without dead ends: 151 [2024-10-13 03:45:34,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-10-13 03:45:34,280 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 111 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:45:34,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 227 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 03:45:34,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-13 03:45:34,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 89. [2024-10-13 03:45:34,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:45:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 135 transitions. [2024-10-13 03:45:34,311 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 135 transitions. Word has length 174 [2024-10-13 03:45:34,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:45:34,313 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 135 transitions. [2024-10-13 03:45:34,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 03:45:34,315 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 135 transitions. [2024-10-13 03:45:34,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-13 03:45:34,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:45:34,318 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:45:34,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-13 03:45:34,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 03:45:34,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:45:34,722 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:45:34,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:45:34,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1085015396, now seen corresponding path program 1 times [2024-10-13 03:45:34,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:45:34,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880705881] [2024-10-13 03:45:34,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:45:34,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:45:34,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:45:34,727 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:45:34,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 03:45:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:35,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 03:45:35,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:45:38,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 84 proven. 216 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 03:45:38,546 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:45:40,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:45:40,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880705881] [2024-10-13 03:45:40,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880705881] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:45:40,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [70799644] [2024-10-13 03:45:40,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:45:40,118 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 03:45:40,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 03:45:40,121 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 03:45:40,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-13 03:45:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:41,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 03:45:41,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:45:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 84 proven. 216 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 03:45:43,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:45:44,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [70799644] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:45:44,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 03:45:44,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2024-10-13 03:45:44,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339416841] [2024-10-13 03:45:44,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 03:45:44,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 03:45:44,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:45:44,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 03:45:44,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-10-13 03:45:44,627 INFO L87 Difference]: Start difference. First operand 89 states and 135 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2024-10-13 03:45:47,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:45:48,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:45:48,281 INFO L93 Difference]: Finished difference Result 191 states and 280 transitions. [2024-10-13 03:45:48,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 03:45:48,282 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) Word has length 175 [2024-10-13 03:45:48,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:45:48,285 INFO L225 Difference]: With dead ends: 191 [2024-10-13 03:45:48,285 INFO L226 Difference]: Without dead ends: 103 [2024-10-13 03:45:48,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-13 03:45:48,287 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 48 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-13 03:45:48,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 321 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-13 03:45:48,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-13 03:45:48,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2024-10-13 03:45:48,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 03:45:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-10-13 03:45:48,301 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 175 [2024-10-13 03:45:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:45:48,302 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-10-13 03:45:48,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2024-10-13 03:45:48,303 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-10-13 03:45:48,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-13 03:45:48,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:45:48,305 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:45:48,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 03:45:48,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-10-13 03:45:48,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-13 03:45:48,707 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:45:48,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:45:48,707 INFO L85 PathProgramCache]: Analyzing trace with hash -720422938, now seen corresponding path program 1 times [2024-10-13 03:45:48,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:45:48,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763852049] [2024-10-13 03:45:48,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:45:48,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:45:48,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:45:48,712 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:45:48,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 03:45:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:49,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 03:45:49,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:45:49,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 728 proven. 39 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2024-10-13 03:45:49,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:45:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 39 proven. 39 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-13 03:45:50,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:45:50,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763852049] [2024-10-13 03:45:50,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763852049] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 03:45:50,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 03:45:50,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-13 03:45:50,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718705300] [2024-10-13 03:45:50,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 03:45:50,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 03:45:50,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:45:50,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 03:45:50,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-13 03:45:50,425 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-10-13 03:45:55,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:45:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:45:56,498 INFO L93 Difference]: Finished difference Result 261 states and 360 transitions. [2024-10-13 03:45:56,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 03:45:56,500 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) Word has length 175 [2024-10-13 03:45:56,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:45:56,502 INFO L225 Difference]: With dead ends: 261 [2024-10-13 03:45:56,502 INFO L226 Difference]: Without dead ends: 161 [2024-10-13 03:45:56,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2024-10-13 03:45:56,505 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 172 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-13 03:45:56,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 520 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-13 03:45:56,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-13 03:45:56,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 154. [2024-10-13 03:45:56,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 104 states have (on average 1.25) internal successors, (130), 105 states have internal predecessors, (130), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 03:45:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 210 transitions. [2024-10-13 03:45:56,533 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 210 transitions. Word has length 175 [2024-10-13 03:45:56,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:45:56,538 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 210 transitions. [2024-10-13 03:45:56,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-10-13 03:45:56,539 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 210 transitions. [2024-10-13 03:45:56,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-13 03:45:56,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:45:56,545 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:45:56,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-13 03:45:56,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:45:56,746 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:45:56,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:45:56,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1113449948, now seen corresponding path program 1 times [2024-10-13 03:45:56,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:45:56,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224701584] [2024-10-13 03:45:56,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:45:56,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:45:56,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:45:56,750 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:45:56,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 03:45:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:45:57,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-13 03:45:57,150 INFO L278 TraceCheckSpWp]: Computing forward predicates...