./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_operatoramount_amount100_file-98.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_operatoramount_amount100_file-98.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 3e656310ec67c2d05ae017a9135a80fcd37a9ab722f93d5597cf89a898d3876d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:58:39,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:58:39,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:58:39,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:58:39,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:58:39,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:58:39,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:58:39,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:58:39,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:58:39,238 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:58:39,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:58:39,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:58:39,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:58:39,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:58:39,244 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:58:39,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:58:39,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:58:39,244 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:58:39,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:58:39,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:58:39,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:58:39,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:58:39,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:58:39,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:58:39,248 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:58:39,248 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:58:39,248 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:58:39,249 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:58:39,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:58:39,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:58:39,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:58:39,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:58:39,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:58:39,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:58:39,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:58:39,250 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:58:39,250 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:58:39,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:58:39,250 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:58:39,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:58:39,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:58:39,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:58:39,252 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 -> 3e656310ec67c2d05ae017a9135a80fcd37a9ab722f93d5597cf89a898d3876d [2024-10-13 04:58:39,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:58:39,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:58:39,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:58:39,492 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:58:39,493 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:58:39,494 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-98.i [2024-10-13 04:58:40,726 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:58:40,917 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:58:40,917 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-98.i [2024-10-13 04:58:40,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e0febc13/a72bfdd1da9e4b31854c23c1be31ea9b/FLAG3687eac12 [2024-10-13 04:58:41,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e0febc13/a72bfdd1da9e4b31854c23c1be31ea9b [2024-10-13 04:58:41,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:58:41,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:58:41,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:58:41,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:58:41,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:58:41,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:58:41" (1/1) ... [2024-10-13 04:58:41,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e70faf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:41, skipping insertion in model container [2024-10-13 04:58:41,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:58:41" (1/1) ... [2024-10-13 04:58:41,336 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:58:41,480 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_operatoramount_amount100_file-98.i[916,929] [2024-10-13 04:58:41,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:58:41,561 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:58:41,572 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_operatoramount_amount100_file-98.i[916,929] [2024-10-13 04:58:41,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:58:41,633 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:58:41,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:41 WrapperNode [2024-10-13 04:58:41,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:58:41,641 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:58:41,641 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:58:41,641 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:58:41,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:41" (1/1) ... [2024-10-13 04:58:41,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:41" (1/1) ... [2024-10-13 04:58:41,715 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-10-13 04:58:41,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:58:41,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:58:41,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:58:41,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:58:41,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:41" (1/1) ... [2024-10-13 04:58:41,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:41" (1/1) ... [2024-10-13 04:58:41,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:41" (1/1) ... [2024-10-13 04:58:41,737 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 04:58:41,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:41" (1/1) ... [2024-10-13 04:58:41,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:41" (1/1) ... [2024-10-13 04:58:41,746 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:41" (1/1) ... [2024-10-13 04:58:41,752 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:41" (1/1) ... [2024-10-13 04:58:41,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:41" (1/1) ... [2024-10-13 04:58:41,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:41" (1/1) ... [2024-10-13 04:58:41,759 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:58:41,760 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:58:41,760 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:58:41,760 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:58:41,761 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:41" (1/1) ... [2024-10-13 04:58:41,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:58:41,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:58:41,789 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 04:58:41,795 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 04:58:41,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:58:41,829 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:58:41,829 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:58:41,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:58:41,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:58:41,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:58:41,891 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:58:41,893 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:58:42,184 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 04:58:42,184 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:58:42,222 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:58:42,222 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:58:42,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:58:42 BoogieIcfgContainer [2024-10-13 04:58:42,223 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:58:42,225 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:58:42,225 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:58:42,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:58:42,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:58:41" (1/3) ... [2024-10-13 04:58:42,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3facbed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:58:42, skipping insertion in model container [2024-10-13 04:58:42,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:58:41" (2/3) ... [2024-10-13 04:58:42,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3facbed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:58:42, skipping insertion in model container [2024-10-13 04:58:42,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:58:42" (3/3) ... [2024-10-13 04:58:42,233 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-98.i [2024-10-13 04:58:42,245 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:58:42,246 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:58:42,298 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:58:42,303 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;@77e97e96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:58:42,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:58:42,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 45 states have (on average 1.488888888888889) internal successors, (67), 46 states have internal predecessors, (67), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 04:58:42,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 04:58:42,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:58:42,325 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:58:42,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:58:42,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:58:42,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1702386981, now seen corresponding path program 1 times [2024-10-13 04:58:42,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:58:42,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611880315] [2024-10-13 04:58:42,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:58:42,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:58:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:58:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:58:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:58:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:58:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:58:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:58:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:58:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:58:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:58:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:58:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 04:58:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:58:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:58:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:58:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:58:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:58:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:58:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:58:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:58:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:58:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 04:58:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 04:58:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 04:58:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:42,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 04:58:42,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:58:42,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611880315] [2024-10-13 04:58:42,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611880315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:58:42,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:58:42,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:58:42,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873615158] [2024-10-13 04:58:42,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:58:42,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:58:42,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:58:42,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:58:42,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:58:42,812 INFO L87 Difference]: Start difference. First operand has 71 states, 45 states have (on average 1.488888888888889) internal successors, (67), 46 states have internal predecessors, (67), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 04:58:42,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:58:42,872 INFO L93 Difference]: Finished difference Result 139 states and 247 transitions. [2024-10-13 04:58:42,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:58:42,876 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 148 [2024-10-13 04:58:42,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:58:42,883 INFO L225 Difference]: With dead ends: 139 [2024-10-13 04:58:42,883 INFO L226 Difference]: Without dead ends: 69 [2024-10-13 04:58:42,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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 04:58:42,890 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:58:42,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:58:42,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-13 04:58:42,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-13 04:58:42,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 44 states have internal predecessors, (62), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 04:58:42,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 108 transitions. [2024-10-13 04:58:42,935 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 108 transitions. Word has length 148 [2024-10-13 04:58:42,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:58:42,937 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 108 transitions. [2024-10-13 04:58:42,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 04:58:42,938 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 108 transitions. [2024-10-13 04:58:42,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 04:58:42,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:58:42,942 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:58:42,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:58:42,943 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:58:42,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:58:42,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1421601321, now seen corresponding path program 1 times [2024-10-13 04:58:42,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:58:42,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415776009] [2024-10-13 04:58:42,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:58:42,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:58:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:58:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:58:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:58:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:58:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:58:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:58:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:58:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:58:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:58:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:58:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 04:58:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:58:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:58:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:58:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:58:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:58:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:58:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:58:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:58:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:58:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 04:58:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 04:58:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 04:58:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:43,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 04:58:43,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:58:43,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415776009] [2024-10-13 04:58:43,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415776009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:58:43,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:58:43,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:58:43,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108161383] [2024-10-13 04:58:43,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:58:43,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 04:58:43,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:58:43,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 04:58:43,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:58:43,282 INFO L87 Difference]: Start difference. First operand 69 states and 108 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 04:58:43,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:58:43,360 INFO L93 Difference]: Finished difference Result 203 states and 318 transitions. [2024-10-13 04:58:43,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 04:58:43,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 148 [2024-10-13 04:58:43,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:58:43,365 INFO L225 Difference]: With dead ends: 203 [2024-10-13 04:58:43,366 INFO L226 Difference]: Without dead ends: 135 [2024-10-13 04:58:43,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:58:43,368 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 95 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:58:43,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 277 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:58:43,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-13 04:58:43,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2024-10-13 04:58:43,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-13 04:58:43,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 207 transitions. [2024-10-13 04:58:43,392 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 207 transitions. Word has length 148 [2024-10-13 04:58:43,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:58:43,393 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 207 transitions. [2024-10-13 04:58:43,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 04:58:43,393 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 207 transitions. [2024-10-13 04:58:43,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 04:58:43,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:58:43,395 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:58:43,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:58:43,395 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:58:43,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:58:43,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1364343019, now seen corresponding path program 1 times [2024-10-13 04:58:43,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:58:43,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116368062] [2024-10-13 04:58:43,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:58:43,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:58:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:58:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:58:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:58:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:58:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:58:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:58:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:58:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:58:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:58:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:58:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 04:58:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:58:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:58:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:58:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:58:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:58:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:58:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:58:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:58:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:58:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 04:58:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 04:58:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 04:58:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:44,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 04:58:44,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:58:44,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116368062] [2024-10-13 04:58:44,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116368062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:58:44,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:58:44,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 04:58:44,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363131957] [2024-10-13 04:58:44,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:58:44,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:58:44,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:58:44,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:58:44,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:58:44,407 INFO L87 Difference]: Start difference. First operand 133 states and 207 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 04:58:44,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:58:44,684 INFO L93 Difference]: Finished difference Result 363 states and 561 transitions. [2024-10-13 04:58:44,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:58:44,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 148 [2024-10-13 04:58:44,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:58:44,689 INFO L225 Difference]: With dead ends: 363 [2024-10-13 04:58:44,689 INFO L226 Difference]: Without dead ends: 231 [2024-10-13 04:58:44,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:58:44,696 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 158 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:58:44,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 378 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:58:44,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-10-13 04:58:44,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 203. [2024-10-13 04:58:44,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 129 states have (on average 1.372093023255814) internal successors, (177), 129 states have internal predecessors, (177), 69 states have call successors, (69), 4 states have call predecessors, (69), 4 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-13 04:58:44,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 315 transitions. [2024-10-13 04:58:44,758 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 315 transitions. Word has length 148 [2024-10-13 04:58:44,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:58:44,759 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 315 transitions. [2024-10-13 04:58:44,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 04:58:44,760 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 315 transitions. [2024-10-13 04:58:44,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 04:58:44,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:58:44,761 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:58:44,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 04:58:44,762 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:58:44,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:58:44,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1909555923, now seen corresponding path program 1 times [2024-10-13 04:58:44,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:58:44,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329081717] [2024-10-13 04:58:44,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:58:44,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:58:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:58:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:58:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:58:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:58:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:58:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:58:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:58:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:58:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:58:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:58:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 04:58:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:58:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:58:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:58:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:58:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:58:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:58:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:58:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:58:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:58:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 04:58:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 04:58:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 04:58:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 04:58:45,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:58:45,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329081717] [2024-10-13 04:58:45,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329081717] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:58:45,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579936039] [2024-10-13 04:58:45,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:58:45,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:58:45,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:58:45,134 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 04:58:45,135 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 04:58:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:45,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 04:58:45,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:58:45,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 498 proven. 24 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-10-13 04:58:45,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:58:45,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 04:58:45,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579936039] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 04:58:45,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 04:58:45,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-13 04:58:45,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630645449] [2024-10-13 04:58:45,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 04:58:45,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:58:45,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:58:45,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:58:45,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:58:45,624 INFO L87 Difference]: Start difference. First operand 203 states and 315 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 04:58:45,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:58:45,809 INFO L93 Difference]: Finished difference Result 431 states and 652 transitions. [2024-10-13 04:58:45,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 04:58:45,810 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 148 [2024-10-13 04:58:45,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:58:45,812 INFO L225 Difference]: With dead ends: 431 [2024-10-13 04:58:45,813 INFO L226 Difference]: Without dead ends: 229 [2024-10-13 04:58:45,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 338 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-13 04:58:45,814 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 156 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:58:45,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 179 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:58:45,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-13 04:58:45,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 215. [2024-10-13 04:58:45,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 138 states have (on average 1.3115942028985508) internal successors, (181), 138 states have internal predecessors, (181), 69 states have call successors, (69), 7 states have call predecessors, (69), 7 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-13 04:58:45,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 319 transitions. [2024-10-13 04:58:45,850 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 319 transitions. Word has length 148 [2024-10-13 04:58:45,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:58:45,851 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 319 transitions. [2024-10-13 04:58:45,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 04:58:45,852 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 319 transitions. [2024-10-13 04:58:45,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 04:58:45,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:58:45,855 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:58:45,875 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 04:58:46,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:58:46,056 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:58:46,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:58:46,057 INFO L85 PathProgramCache]: Analyzing trace with hash 657542308, now seen corresponding path program 1 times [2024-10-13 04:58:46,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:58:46,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397350574] [2024-10-13 04:58:46,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:58:46,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:58:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:58:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:58:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:58:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:58:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:58:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:58:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:58:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:58:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:58:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:58:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 04:58:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:58:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:58:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:58:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:58:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:58:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:58:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:58:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:58:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:58:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 04:58:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 04:58:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 04:58:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 04:58:46,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:58:46,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397350574] [2024-10-13 04:58:46,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397350574] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:58:46,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95730521] [2024-10-13 04:58:46,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:58:46,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:58:46,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:58:46,487 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 04:58:46,488 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 04:58:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:46,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 04:58:46,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:58:47,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 372 proven. 51 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-10-13 04:58:47,243 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:58:47,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 04:58:47,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95730521] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 04:58:47,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 04:58:47,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 18 [2024-10-13 04:58:47,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028044425] [2024-10-13 04:58:47,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 04:58:47,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 04:58:47,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:58:47,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 04:58:47,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2024-10-13 04:58:47,445 INFO L87 Difference]: Start difference. First operand 215 states and 319 transitions. Second operand has 18 states, 17 states have (on average 5.176470588235294) internal successors, (88), 18 states have internal predecessors, (88), 7 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 6 states have call predecessors, (69), 7 states have call successors, (69) [2024-10-13 04:58:48,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:58:48,079 INFO L93 Difference]: Finished difference Result 650 states and 958 transitions. [2024-10-13 04:58:48,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 04:58:48,080 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.176470588235294) internal successors, (88), 18 states have internal predecessors, (88), 7 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 6 states have call predecessors, (69), 7 states have call successors, (69) Word has length 149 [2024-10-13 04:58:48,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:58:48,084 INFO L225 Difference]: With dead ends: 650 [2024-10-13 04:58:48,084 INFO L226 Difference]: Without dead ends: 436 [2024-10-13 04:58:48,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=503, Unknown=0, NotChecked=0, Total=702 [2024-10-13 04:58:48,086 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 463 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:58:48,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 516 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 04:58:48,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-10-13 04:58:48,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 271. [2024-10-13 04:58:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 167 states have (on average 1.2574850299401197) internal successors, (210), 167 states have internal predecessors, (210), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-13 04:58:48,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 394 transitions. [2024-10-13 04:58:48,158 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 394 transitions. Word has length 149 [2024-10-13 04:58:48,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:58:48,158 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 394 transitions. [2024-10-13 04:58:48,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.176470588235294) internal successors, (88), 18 states have internal predecessors, (88), 7 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 6 states have call predecessors, (69), 7 states have call successors, (69) [2024-10-13 04:58:48,159 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 394 transitions. [2024-10-13 04:58:48,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 04:58:48,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:58:48,161 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:58:48,177 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 04:58:48,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:58:48,362 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:58:48,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:58:48,363 INFO L85 PathProgramCache]: Analyzing trace with hash -930805594, now seen corresponding path program 1 times [2024-10-13 04:58:48,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:58:48,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447427148] [2024-10-13 04:58:48,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:58:48,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:58:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:58:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:58:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 04:58:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:58:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 04:58:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:58:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 04:58:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:58:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 04:58:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:58:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 04:58:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:58:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 04:58:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:58:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 04:58:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:58:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:58:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:58:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:58:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:58:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 04:58:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 04:58:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 04:58:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 144 proven. 126 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2024-10-13 04:58:54,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:58:54,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447427148] [2024-10-13 04:58:54,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447427148] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:58:54,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196320824] [2024-10-13 04:58:54,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:58:54,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:58:54,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:58:54,205 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 04:58:54,206 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 04:58:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:58:54,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-13 04:58:54,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:58:56,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 495 proven. 228 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2024-10-13 04:58:56,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:59:11,483 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 04:59:23,499 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 04:59:35,530 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 04:59:43,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196320824] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:59:43,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 04:59:43,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 30] total 46 [2024-10-13 04:59:43,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878999454] [2024-10-13 04:59:43,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 04:59:43,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-13 04:59:43,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:59:43,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-13 04:59:43,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=2720, Unknown=0, NotChecked=0, Total=3192 [2024-10-13 04:59:43,618 INFO L87 Difference]: Start difference. First operand 271 states and 394 transitions. Second operand has 46 states, 42 states have (on average 2.380952380952381) internal successors, (100), 40 states have internal predecessors, (100), 15 states have call successors, (46), 8 states have call predecessors, (46), 12 states have return successors, (46), 14 states have call predecessors, (46), 15 states have call successors, (46) [2024-10-13 05:00:02,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:00:02,224 INFO L93 Difference]: Finished difference Result 1178 states and 1538 transitions. [2024-10-13 05:00:02,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2024-10-13 05:00:02,225 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 2.380952380952381) internal successors, (100), 40 states have internal predecessors, (100), 15 states have call successors, (46), 8 states have call predecessors, (46), 12 states have return successors, (46), 14 states have call predecessors, (46), 15 states have call successors, (46) Word has length 149 [2024-10-13 05:00:02,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:00:02,231 INFO L225 Difference]: With dead ends: 1178 [2024-10-13 05:00:02,231 INFO L226 Difference]: Without dead ends: 1038 [2024-10-13 05:00:02,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24716 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=7834, Invalid=57446, Unknown=0, NotChecked=0, Total=65280 [2024-10-13 05:00:02,250 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 2198 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 4068 mSolverCounterSat, 665 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2203 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 4733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 665 IncrementalHoareTripleChecker+Valid, 4068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-13 05:00:02,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2203 Valid, 1959 Invalid, 4733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [665 Valid, 4068 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-13 05:00:02,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2024-10-13 05:00:02,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 576. [2024-10-13 05:00:02,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 381 states have (on average 1.1863517060367454) internal successors, (452), 381 states have internal predecessors, (452), 138 states have call successors, (138), 56 states have call predecessors, (138), 56 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2024-10-13 05:00:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 728 transitions. [2024-10-13 05:00:02,392 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 728 transitions. Word has length 149 [2024-10-13 05:00:02,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:00:02,393 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 728 transitions. [2024-10-13 05:00:02,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 2.380952380952381) internal successors, (100), 40 states have internal predecessors, (100), 15 states have call successors, (46), 8 states have call predecessors, (46), 12 states have return successors, (46), 14 states have call predecessors, (46), 15 states have call successors, (46) [2024-10-13 05:00:02,394 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 728 transitions. [2024-10-13 05:00:02,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 05:00:02,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:00:02,395 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:00:02,419 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 05:00:02,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:00:02,597 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:00:02,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:00:02,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1740152220, now seen corresponding path program 1 times [2024-10-13 05:00:02,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:00:02,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249705290] [2024-10-13 05:00:02,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:00:02,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:00:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 05:00:02,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [857989241] [2024-10-13 05:00:02,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:00:02,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:00:02,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:00:02,699 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 05:00:02,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 05:00:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:00:02,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 05:00:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:00:02,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 05:00:02,984 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 05:00:02,985 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:00:03,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 05:00:03,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:00:03,191 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:00:03,295 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:00:03,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:00:03 BoogieIcfgContainer [2024-10-13 05:00:03,302 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:00:03,303 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:00:03,303 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:00:03,303 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:00:03,303 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:58:42" (3/4) ... [2024-10-13 05:00:03,305 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 05:00:03,306 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:00:03,306 INFO L158 Benchmark]: Toolchain (without parser) took 82005.84ms. Allocated memory was 186.6MB in the beginning and 513.8MB in the end (delta: 327.2MB). Free memory was 120.7MB in the beginning and 361.7MB in the end (delta: -241.0MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. [2024-10-13 05:00:03,307 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 69.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:00:03,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.82ms. Allocated memory is still 186.6MB. Free memory was 120.5MB in the beginning and 159.6MB in the end (delta: -39.0MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2024-10-13 05:00:03,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.07ms. Allocated memory is still 186.6MB. Free memory was 159.6MB in the beginning and 156.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 05:00:03,307 INFO L158 Benchmark]: Boogie Preprocessor took 43.94ms. Allocated memory is still 186.6MB. Free memory was 156.4MB in the beginning and 152.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:00:03,307 INFO L158 Benchmark]: RCFGBuilder took 462.74ms. Allocated memory is still 186.6MB. Free memory was 152.2MB in the beginning and 123.5MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-13 05:00:03,308 INFO L158 Benchmark]: TraceAbstraction took 81077.09ms. Allocated memory was 186.6MB in the beginning and 513.8MB in the end (delta: 327.2MB). Free memory was 122.8MB in the beginning and 361.7MB in the end (delta: -238.9MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. [2024-10-13 05:00:03,308 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 513.8MB. Free memory is still 361.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:00:03,309 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 69.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.82ms. Allocated memory is still 186.6MB. Free memory was 120.5MB in the beginning and 159.6MB in the end (delta: -39.0MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.07ms. Allocated memory is still 186.6MB. Free memory was 159.6MB in the beginning and 156.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.94ms. Allocated memory is still 186.6MB. Free memory was 156.4MB in the beginning and 152.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 462.74ms. Allocated memory is still 186.6MB. Free memory was 152.2MB in the beginning and 123.5MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 81077.09ms. Allocated memory was 186.6MB in the beginning and 513.8MB in the end (delta: 327.2MB). Free memory was 122.8MB in the beginning and 361.7MB in the end (delta: -238.9MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 513.8MB. Free memory is still 361.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 172, overapproximation of someBinaryArithmeticFLOAToperation at line 74. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -2; [L23] unsigned long int var_1_4 = 128; [L24] signed char var_1_5 = 100; [L25] signed char var_1_6 = 5; [L26] signed char var_1_7 = 25; [L27] signed long int var_1_8 = 0; [L28] signed long int var_1_9 = 100; [L29] signed char var_1_10 = 10; [L30] unsigned char var_1_11 = 1; [L31] unsigned char var_1_12 = 0; [L32] unsigned char var_1_14 = 0; [L33] float var_1_15 = 63.5; [L34] float var_1_16 = 0.0; [L35] float var_1_17 = 8.16; [L36] float var_1_18 = 4.625; [L37] float var_1_19 = 1000000.2; [L38] float var_1_20 = 5.2; [L39] signed char var_1_21 = 8; [L40] signed long int var_1_22 = 64; [L41] signed char var_1_24 = 10; [L42] float var_1_25 = 0.0; [L43] float var_1_26 = 128.55; [L44] signed char var_1_27 = 16; [L45] unsigned long int var_1_28 = 256; [L46] signed short int var_1_29 = -128; [L47] signed char last_1_var_1_10 = 10; [L48] signed long int last_1_var_1_22 = 64; [L49] unsigned long int last_1_var_1_28 = 256; [L176] isInitial = 1 [L177] FCALL initially() [L178] COND TRUE 1 [L179] CALL updateLastVariables() [L167] last_1_var_1_10 = var_1_10 [L168] last_1_var_1_22 = var_1_22 [L169] last_1_var_1_28 = var_1_28 [L179] RET updateLastVariables() [L180] CALL updateVariables() [L128] var_1_4 = __VERIFIER_nondet_ulong() [L129] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L129] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L130] CALL assume_abort_if_not(var_1_4 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L130] RET assume_abort_if_not(var_1_4 <= 4294967295) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L131] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L131] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L132] var_1_5 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_5 >= 62) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L133] RET assume_abort_if_not(var_1_5 >= 62) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L134] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L134] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L135] var_1_6 = __VERIFIER_nondet_char() [L136] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=25, var_1_8=0, var_1_9=100] [L136] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=25, var_1_8=0, var_1_9=100] [L137] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=25, var_1_8=0, var_1_9=100] [L137] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=25, var_1_8=0, var_1_9=100] [L138] var_1_7 = __VERIFIER_nondet_char() [L139] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=100] [L139] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=100] [L140] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=100] [L140] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=100] [L141] var_1_9 = __VERIFIER_nondet_long() [L142] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L142] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L143] CALL assume_abort_if_not(var_1_9 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L143] RET assume_abort_if_not(var_1_9 <= 2147483646) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L144] var_1_12 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L145] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L146] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L146] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L147] var_1_14 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L148] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L149] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L149] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L150] var_1_16 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_16 >= 4611686.018427382800e+12F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L151] RET assume_abort_if_not((var_1_16 >= 4611686.018427382800e+12F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L152] var_1_17 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L153] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L154] var_1_18 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L155] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L156] var_1_19 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L157] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L158] var_1_25 = __VERIFIER_nondet_float() [L159] CALL assume_abort_if_not((var_1_25 >= 4611686.018427387900e+12F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854776000e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L159] RET assume_abort_if_not((var_1_25 >= 4611686.018427387900e+12F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854776000e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L160] var_1_26 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427387900e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L161] RET assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427387900e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L162] var_1_27 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L163] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L164] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L164] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L180] RET updateVariables() [L181] CALL step() [L53] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L56] COND FALSE !(last_1_var_1_10 >= (var_1_6 + last_1_var_1_22)) [L59] var_1_21 = var_1_7 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L62] COND FALSE !(last_1_var_1_28 <= ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L65] COND TRUE \read(var_1_12) [L66] var_1_11 = (((var_1_20 + 31.75f) <= 4.2f) && var_1_14) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L68] signed char stepLocal_0 = var_1_7; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_0=0, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=48] [L69] COND TRUE stepLocal_0 != var_1_4 [L70] var_1_8 = ((var_1_7 + ((((var_1_6) > (var_1_5)) ? (var_1_6) : (var_1_5)))) - var_1_9) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=14, var_1_9=48] [L74] var_1_15 = ((((((var_1_16 - var_1_17)) > (var_1_18)) ? ((var_1_16 - var_1_17)) : (var_1_18))) - var_1_19) [L75] unsigned char stepLocal_3 = var_1_11; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=14, var_1_9=48] [L76] COND TRUE var_1_17 > (((((var_1_19) > (var_1_16)) ? (var_1_19) : (var_1_16))) - (var_1_25 - var_1_26)) [L77] var_1_24 = (32 - (var_1_6 + var_1_27)) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=32, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=14, var_1_9=48] [L89] COND FALSE !(\read(var_1_11)) [L98] var_1_28 = ((((var_1_7) > (var_1_6)) ? (var_1_7) : (var_1_6))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=32, var_1_27=0, var_1_28=0, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=14, var_1_9=48] [L100] signed long int stepLocal_1 = var_1_24 + (var_1_5 - var_1_7); VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_1=94, stepLocal_3=0, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=32, var_1_27=0, var_1_28=0, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=14, var_1_9=48] [L101] COND FALSE !(var_1_6 >= stepLocal_1) [L104] var_1_10 = var_1_7 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=32, var_1_27=0, var_1_28=0, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=14, var_1_9=48] [L106] unsigned char stepLocal_2 = var_1_11; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=32, var_1_27=0, var_1_28=0, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=14, var_1_9=48] [L107] COND FALSE !(stepLocal_2 && var_1_11) [L110] var_1_22 = ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=0, var_1_24=32, var_1_27=0, var_1_28=0, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=14, var_1_9=48] [L112] COND FALSE !(10u <= ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=0, var_1_24=32, var_1_27=0, var_1_28=0, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=14, var_1_9=48] [L117] COND FALSE !((var_1_8 > var_1_22) && (var_1_19 < (var_1_15 / var_1_16))) [L124] var_1_29 = var_1_27 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=0, var_1_24=32, var_1_27=0, var_1_28=0, var_1_29=0, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=14, var_1_9=48] [L181] RET step() [L182] CALL, EXPR property() [L172-L173] return (((((((((((10u <= ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))) ? ((((((16u) < (var_1_22)) ? (16u) : (var_1_22))) >= (var_1_8 % var_1_4)) ? (var_1_1 == ((signed char) ((var_1_5 - var_1_6) - var_1_7))) : 1) : 1) && ((var_1_7 != var_1_4) ? (var_1_8 == ((signed long int) ((var_1_7 + ((((var_1_6) > (var_1_5)) ? (var_1_6) : (var_1_5)))) - var_1_9))) : (var_1_8 == ((signed long int) var_1_21)))) && ((var_1_6 >= (var_1_24 + (var_1_5 - var_1_7))) ? (var_1_10 == ((signed char) (var_1_7 - var_1_6))) : (var_1_10 == ((signed char) var_1_7)))) && (var_1_12 ? (var_1_11 == ((unsigned char) (((var_1_20 + 31.75f) <= 4.2f) && var_1_14))) : 1)) && (var_1_15 == ((float) ((((((var_1_16 - var_1_17)) > (var_1_18)) ? ((var_1_16 - var_1_17)) : (var_1_18))) - var_1_19)))) && ((last_1_var_1_28 <= ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) ? (var_1_20 == ((float) ((((var_1_17) < (var_1_16)) ? (var_1_17) : (var_1_16))))) : 1)) && (var_1_14 ? (var_1_21 == ((signed char) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))) : ((last_1_var_1_10 >= (var_1_6 + last_1_var_1_22)) ? (var_1_21 == ((signed char) var_1_6)) : (var_1_21 == ((signed char) var_1_7))))) && ((var_1_11 && var_1_11) ? (var_1_22 == ((signed long int) (((((var_1_6 + var_1_10) + var_1_21) < 0 ) ? -((var_1_6 + var_1_10) + var_1_21) : ((var_1_6 + var_1_10) + var_1_21))))) : (var_1_22 == ((signed long int) ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))))))) && ((var_1_17 > (((((var_1_19) > (var_1_16)) ? (var_1_19) : (var_1_16))) - (var_1_25 - var_1_26))) ? (var_1_24 == ((signed char) (32 - (var_1_6 + var_1_27)))) : ((var_1_11 && (var_1_11 && var_1_14)) ? (var_1_24 == ((signed char) (var_1_6 + var_1_27))) : ((var_1_15 >= var_1_18) ? (var_1_24 == ((signed char) var_1_6)) : (var_1_24 == ((signed char) var_1_27)))))) && (var_1_11 ? ((! (var_1_20 >= var_1_16)) ? (var_1_28 == ((unsigned long int) (var_1_27 + var_1_5))) : (((- var_1_26) < (- (var_1_15 + var_1_17))) ? (var_1_28 == ((unsigned long int) ((((var_1_7) > (var_1_27)) ? (var_1_7) : (var_1_27))))) : 1)) : (var_1_28 == ((unsigned long int) ((((var_1_7) > (var_1_6)) ? (var_1_7) : (var_1_6))))))) && (((var_1_8 > var_1_22) && (var_1_19 < (var_1_15 / var_1_16))) ? ((var_1_27 != (var_1_7 - var_1_6)) ? (var_1_29 == ((signed short int) (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))) - ((10000 - var_1_5) + var_1_27)))) : (var_1_29 == ((signed short int) var_1_10))) : (var_1_29 == ((signed short int) var_1_27))) ; [L182] RET, EXPR property() [L182] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=0, var_1_24=32, var_1_27=0, var_1_28=0, var_1_29=0, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=14, var_1_9=48] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=0, var_1_24=32, var_1_27=0, var_1_28=0, var_1_29=0, var_1_4=1, var_1_5=62, var_1_6=0, var_1_7=0, var_1_8=14, var_1_9=48] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 80.9s, OverallIterations: 7, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3110 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3070 mSDsluCounter, 3414 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2754 mSDsCounter, 970 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4896 IncrementalHoareTripleChecker+Invalid, 5866 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 970 mSolverCounterUnsat, 660 mSDtfsCounter, 4896 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1361 GetRequests, 1065 SyntacticMatches, 1 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24845 ImplicationChecksByTransitivity, 22.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=576occurred in iteration=6, InterpolantAutomatonStates: 246, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 671 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 57.8s InterpolantComputationTime, 1634 NumberOfCodeBlocks, 1634 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1622 ConstructedInterpolants, 0 QuantifiedInterpolants, 9703 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1063 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 10553/11132 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 05:00:03,521 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-13 05:00:03,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_operatoramount_amount100_file-98.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 3e656310ec67c2d05ae017a9135a80fcd37a9ab722f93d5597cf89a898d3876d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:00:05,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:00:05,403 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 05:00:05,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:00:05,409 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:00:05,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:00:05,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:00:05,441 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:00:05,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:00:05,442 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:00:05,442 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:00:05,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:00:05,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:00:05,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:00:05,443 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:00:05,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:00:05,444 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:00:05,444 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:00:05,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:00:05,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:00:05,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:00:05,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:00:05,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:00:05,451 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 05:00:05,452 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 05:00:05,452 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:00:05,452 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 05:00:05,452 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:00:05,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:00:05,453 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:00:05,453 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:00:05,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:00:05,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:00:05,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:00:05,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:00:05,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:00:05,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:00:05,455 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:00:05,455 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 05:00:05,456 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 05:00:05,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:00:05,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:00:05,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:00:05,457 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:00:05,457 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 05:00:05,457 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 -> 3e656310ec67c2d05ae017a9135a80fcd37a9ab722f93d5597cf89a898d3876d [2024-10-13 05:00:05,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:00:05,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:00:05,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:00:05,792 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:00:05,793 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:00:05,797 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-98.i [2024-10-13 05:00:07,520 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:00:07,711 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:00:07,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-98.i [2024-10-13 05:00:07,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c417be3f5/246a78c79827445bb644d383915d5b51/FLAGc69be41d7 [2024-10-13 05:00:07,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c417be3f5/246a78c79827445bb644d383915d5b51 [2024-10-13 05:00:07,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:00:07,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:00:07,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:00:07,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:00:07,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:00:07,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:00:07" (1/1) ... [2024-10-13 05:00:07,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dd96109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:00:07, skipping insertion in model container [2024-10-13 05:00:07,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:00:07" (1/1) ... [2024-10-13 05:00:07,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:00:07,954 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_operatoramount_amount100_file-98.i[916,929] [2024-10-13 05:00:08,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:00:08,045 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:00:08,060 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_operatoramount_amount100_file-98.i[916,929] [2024-10-13 05:00:08,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:00:08,124 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:00:08,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:00:08 WrapperNode [2024-10-13 05:00:08,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:00:08,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:00:08,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:00:08,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:00:08,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:00:08" (1/1) ... [2024-10-13 05:00:08,146 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:00:08" (1/1) ... [2024-10-13 05:00:08,181 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-10-13 05:00:08,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:00:08,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:00:08,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:00:08,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:00:08,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:00:08" (1/1) ... [2024-10-13 05:00:08,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:00:08" (1/1) ... [2024-10-13 05:00:08,201 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:00:08" (1/1) ... [2024-10-13 05:00:08,218 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 05:00:08,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:00:08" (1/1) ... [2024-10-13 05:00:08,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:00:08" (1/1) ... [2024-10-13 05:00:08,235 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:00:08" (1/1) ... [2024-10-13 05:00:08,238 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:00:08" (1/1) ... [2024-10-13 05:00:08,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:00:08" (1/1) ... [2024-10-13 05:00:08,242 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:00:08" (1/1) ... [2024-10-13 05:00:08,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:00:08,251 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:00:08,251 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:00:08,251 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:00:08,252 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:00:08" (1/1) ... [2024-10-13 05:00:08,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:00:08,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:00:08,287 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 05:00:08,296 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 05:00:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:00:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 05:00:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:00:08,342 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:00:08,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:00:08,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:00:08,440 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:00:08,442 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation