./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_fillercode_fillercodestructure_filler-ps-co_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1380cfc36c62c1d753945810f92d4eba7bc79d804922edbd332f86c5fd94ebd5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:27:39,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:27:39,418 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:27:39,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:27:39,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:27:39,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:27:39,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:27:39,468 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:27:39,468 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:27:39,469 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:27:39,469 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:27:39,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:27:39,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:27:39,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:27:39,471 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:27:39,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:27:39,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:27:39,472 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:27:39,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:27:39,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:27:39,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:27:39,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:27:39,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:27:39,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:27:39,475 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:27:39,475 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:27:39,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:27:39,476 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:27:39,476 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:27:39,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:27:39,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:27:39,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:27:39,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:27:39,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:27:39,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:27:39,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:27:39,479 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:27:39,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:27:39,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:27:39,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:27:39,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:27:39,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:27:39,481 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1380cfc36c62c1d753945810f92d4eba7bc79d804922edbd332f86c5fd94ebd5 [2024-10-11 10:27:39,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:27:39,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:27:39,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:27:39,810 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:27:39,810 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:27:39,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i [2024-10-11 10:27:41,260 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:27:41,485 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:27:41,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i [2024-10-11 10:27:41,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a0079067f/eae966717ed243dab6bb142e94a86c47/FLAG07b20b554 [2024-10-11 10:27:41,508 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a0079067f/eae966717ed243dab6bb142e94a86c47 [2024-10-11 10:27:41,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:27:41,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:27:41,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:27:41,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:27:41,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:27:41,522 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:27:41" (1/1) ... [2024-10-11 10:27:41,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44adea0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:27:41, skipping insertion in model container [2024-10-11 10:27:41,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:27:41" (1/1) ... [2024-10-11 10:27:41,563 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:27:41,746 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_fillercode_fillercodestructure_filler-ps-co_file-78.i[919,932] [2024-10-11 10:27:41,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:27:41,895 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:27:41,910 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_fillercode_fillercodestructure_filler-ps-co_file-78.i[919,932] [2024-10-11 10:27:41,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:27:42,002 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:27:42,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:27:42 WrapperNode [2024-10-11 10:27:42,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:27:42,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:27:42,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:27:42,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:27:42,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:27:42" (1/1) ... [2024-10-11 10:27:42,025 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:27:42" (1/1) ... [2024-10-11 10:27:42,086 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 279 [2024-10-11 10:27:42,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:27:42,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:27:42,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:27:42,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:27:42,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:27:42" (1/1) ... [2024-10-11 10:27:42,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:27:42" (1/1) ... [2024-10-11 10:27:42,114 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:27:42" (1/1) ... [2024-10-11 10:27:42,167 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:27:42,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:27:42" (1/1) ... [2024-10-11 10:27:42,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:27:42" (1/1) ... [2024-10-11 10:27:42,186 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:27:42" (1/1) ... [2024-10-11 10:27:42,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:27:42" (1/1) ... [2024-10-11 10:27:42,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:27:42" (1/1) ... [2024-10-11 10:27:42,202 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:27:42" (1/1) ... [2024-10-11 10:27:42,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:27:42,211 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:27:42,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:27:42,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:27:42,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:27:42" (1/1) ... [2024-10-11 10:27:42,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:27:42,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:27:42,257 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:27:42,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:27:42,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:27:42,314 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:27:42,315 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:27:42,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:27:42,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:27:42,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:27:42,399 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:27:42,401 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:27:43,120 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-11 10:27:43,122 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:27:43,158 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:27:43,158 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:27:43,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:27:43 BoogieIcfgContainer [2024-10-11 10:27:43,159 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:27:43,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:27:43,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:27:43,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:27:43,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:27:41" (1/3) ... [2024-10-11 10:27:43,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f4501e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:27:43, skipping insertion in model container [2024-10-11 10:27:43,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:27:42" (2/3) ... [2024-10-11 10:27:43,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f4501e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:27:43, skipping insertion in model container [2024-10-11 10:27:43,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:27:43" (3/3) ... [2024-10-11 10:27:43,170 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i [2024-10-11 10:27:43,187 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:27:43,188 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:27:43,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:27:43,279 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;@453a043d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:27:43,280 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:27:43,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 78 states have internal predecessors, (116), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 10:27:43,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-11 10:27:43,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:27:43,309 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:27:43,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:27:43,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:27:43,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1736333692, now seen corresponding path program 1 times [2024-10-11 10:27:43,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:27:43,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115045170] [2024-10-11 10:27:43,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:27:43,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:27:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:27:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:27:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:27:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:27:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:27:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:27:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:27:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:27:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:27:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:27:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:27:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:27:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:27:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:27:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:27:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:27:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:27:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:27:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:27:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:27:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:27:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:27:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:27:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:27:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:27:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:27:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:27:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:27:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:27:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:27:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:27:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:27:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:43,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 10:27:43,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:27:43,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115045170] [2024-10-11 10:27:43,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115045170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:27:43,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:27:43,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:27:43,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686551166] [2024-10-11 10:27:43,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:27:43,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:27:43,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:27:43,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:27:43,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:27:43,973 INFO L87 Difference]: Start difference. First operand has 112 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 78 states have internal predecessors, (116), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 10:27:44,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:27:44,017 INFO L93 Difference]: Finished difference Result 221 states and 390 transitions. [2024-10-11 10:27:44,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:27:44,020 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 205 [2024-10-11 10:27:44,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:27:44,029 INFO L225 Difference]: With dead ends: 221 [2024-10-11 10:27:44,029 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 10:27:44,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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-11 10:27:44,040 INFO L432 NwaCegarLoop]: 172 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, 172 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-11 10:27:44,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:27:44,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 10:27:44,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-11 10:27:44,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 76 states have internal predecessors, (111), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 10:27:44,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 175 transitions. [2024-10-11 10:27:44,099 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 175 transitions. Word has length 205 [2024-10-11 10:27:44,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:27:44,099 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 175 transitions. [2024-10-11 10:27:44,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 10:27:44,100 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 175 transitions. [2024-10-11 10:27:44,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-11 10:27:44,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:27:44,108 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:27:44,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:27:44,108 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:27:44,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:27:44,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1243381712, now seen corresponding path program 1 times [2024-10-11 10:27:44,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:27:44,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625902621] [2024-10-11 10:27:44,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:27:44,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:27:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:44,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:27:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:44,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:27:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:44,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:27:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:44,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:27:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:44,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:27:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:44,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:27:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:44,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:27:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:44,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:27:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:44,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:27:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:44,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:27:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:44,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:27:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:44,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:27:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:44,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:27:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:44,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:27:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:44,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:27:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:44,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:27:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:44,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:27:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:44,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:27:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:44,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:27:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:44,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:27:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:44,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:27:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:27:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:27:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:27:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:27:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:27:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:27:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:27:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:27:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:27:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:27:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:27:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 10:27:45,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:27:45,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625902621] [2024-10-11 10:27:45,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625902621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:27:45,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:27:45,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 10:27:45,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413827114] [2024-10-11 10:27:45,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:27:45,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 10:27:45,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:27:45,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 10:27:45,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 10:27:45,068 INFO L87 Difference]: Start difference. First operand 110 states and 175 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:27:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:27:45,363 INFO L93 Difference]: Finished difference Result 255 states and 403 transitions. [2024-10-11 10:27:45,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 10:27:45,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2024-10-11 10:27:45,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:27:45,368 INFO L225 Difference]: With dead ends: 255 [2024-10-11 10:27:45,368 INFO L226 Difference]: Without dead ends: 146 [2024-10-11 10:27:45,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:27:45,372 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 42 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:27:45,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 821 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:27:45,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-11 10:27:45,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 128. [2024-10-11 10:27:45,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 94 states have internal predecessors, (140), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 10:27:45,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 204 transitions. [2024-10-11 10:27:45,409 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 204 transitions. Word has length 205 [2024-10-11 10:27:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:27:45,411 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 204 transitions. [2024-10-11 10:27:45,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:27:45,412 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 204 transitions. [2024-10-11 10:27:45,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-11 10:27:45,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:27:45,416 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:27:45,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:27:45,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:27:45,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:27:45,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1463237682, now seen corresponding path program 1 times [2024-10-11 10:27:45,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:27:45,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503522437] [2024-10-11 10:27:45,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:27:45,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:27:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:27:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:27:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:27:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:27:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:27:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:27:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:27:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:27:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:27:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:27:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:27:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:27:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:27:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:27:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:27:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:27:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:27:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:27:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:27:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:27:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:27:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:27:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:27:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:27:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:27:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:27:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:27:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:27:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:27:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:27:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:27:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:27:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 10:27:45,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:27:45,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503522437] [2024-10-11 10:27:45,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503522437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:27:45,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:27:45,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:27:45,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802514800] [2024-10-11 10:27:45,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:27:45,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:27:45,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:27:45,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:27:45,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:27:45,703 INFO L87 Difference]: Start difference. First operand 128 states and 204 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:27:45,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:27:45,736 INFO L93 Difference]: Finished difference Result 255 states and 407 transitions. [2024-10-11 10:27:45,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:27:45,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2024-10-11 10:27:45,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:27:45,739 INFO L225 Difference]: With dead ends: 255 [2024-10-11 10:27:45,739 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 10:27:45,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:27:45,742 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:27:45,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 499 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:27:45,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 10:27:45,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-10-11 10:27:45,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 94 states have (on average 1.4680851063829787) internal successors, (138), 94 states have internal predecessors, (138), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 10:27:45,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 202 transitions. [2024-10-11 10:27:45,756 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 202 transitions. Word has length 205 [2024-10-11 10:27:45,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:27:45,758 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 202 transitions. [2024-10-11 10:27:45,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:27:45,758 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 202 transitions. [2024-10-11 10:27:45,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-11 10:27:45,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:27:45,761 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:27:45,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:27:45,762 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:27:45,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:27:45,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2068331951, now seen corresponding path program 1 times [2024-10-11 10:27:45,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:27:45,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375852004] [2024-10-11 10:27:45,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:27:45,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:27:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:27:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:27:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:27:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:27:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:27:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:45,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:27:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:27:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:27:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:27:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:27:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:27:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:27:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:27:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:27:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:27:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:27:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:27:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:27:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:27:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:27:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:27:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:27:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:27:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:27:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:27:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:27:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:27:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:27:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:27:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:27:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:27:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:27:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 10:27:46,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:27:46,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375852004] [2024-10-11 10:27:46,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375852004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:27:46,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:27:46,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:27:46,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811974593] [2024-10-11 10:27:46,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:27:46,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:27:46,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:27:46,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:27:46,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:27:46,148 INFO L87 Difference]: Start difference. First operand 128 states and 202 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:27:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:27:46,398 INFO L93 Difference]: Finished difference Result 383 states and 605 transitions. [2024-10-11 10:27:46,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:27:46,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2024-10-11 10:27:46,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:27:46,405 INFO L225 Difference]: With dead ends: 383 [2024-10-11 10:27:46,405 INFO L226 Difference]: Without dead ends: 256 [2024-10-11 10:27:46,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:27:46,407 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 147 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:27:46,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 475 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:27:46,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-11 10:27:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 240. [2024-10-11 10:27:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 173 states have (on average 1.4566473988439306) internal successors, (252), 173 states have internal predecessors, (252), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 10:27:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 380 transitions. [2024-10-11 10:27:46,455 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 380 transitions. Word has length 206 [2024-10-11 10:27:46,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:27:46,457 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 380 transitions. [2024-10-11 10:27:46,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:27:46,458 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 380 transitions. [2024-10-11 10:27:46,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-11 10:27:46,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:27:46,461 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:27:46,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:27:46,461 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:27:46,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:27:46,462 INFO L85 PathProgramCache]: Analyzing trace with hash 840347522, now seen corresponding path program 1 times [2024-10-11 10:27:46,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:27:46,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49578465] [2024-10-11 10:27:46,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:27:46,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:27:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:27:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:27:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:27:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:27:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:27:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:27:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:27:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:27:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:27:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:27:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:27:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:27:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:27:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:27:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:27:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:27:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:27:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:27:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:27:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:27:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:27:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:27:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:27:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:27:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:27:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:27:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:27:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:27:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:27:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:27:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:27:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:27:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 10:27:46,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:27:46,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49578465] [2024-10-11 10:27:46,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49578465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:27:46,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:27:46,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:27:46,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97273166] [2024-10-11 10:27:46,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:27:46,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:27:46,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:27:46,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:27:46,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:27:46,878 INFO L87 Difference]: Start difference. First operand 240 states and 380 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:27:47,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:27:47,115 INFO L93 Difference]: Finished difference Result 549 states and 860 transitions. [2024-10-11 10:27:47,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:27:47,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2024-10-11 10:27:47,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:27:47,119 INFO L225 Difference]: With dead ends: 549 [2024-10-11 10:27:47,120 INFO L226 Difference]: Without dead ends: 393 [2024-10-11 10:27:47,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:27:47,122 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 184 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:27:47,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 500 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:27:47,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-11 10:27:47,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 376. [2024-10-11 10:27:47,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 276 states have (on average 1.4384057971014492) internal successors, (397), 276 states have internal predecessors, (397), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 10:27:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 589 transitions. [2024-10-11 10:27:47,163 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 589 transitions. Word has length 207 [2024-10-11 10:27:47,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:27:47,164 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 589 transitions. [2024-10-11 10:27:47,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:27:47,164 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 589 transitions. [2024-10-11 10:27:47,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-11 10:27:47,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:27:47,167 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:27:47,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 10:27:47,167 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:27:47,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:27:47,168 INFO L85 PathProgramCache]: Analyzing trace with hash -395850220, now seen corresponding path program 1 times [2024-10-11 10:27:47,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:27:47,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733542735] [2024-10-11 10:27:47,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:27:47,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:27:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:27:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:27:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:27:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:27:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:27:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:27:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:27:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:27:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:27:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:27:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:27:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:27:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:27:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:27:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:27:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:27:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:27:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:27:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:27:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:27:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:27:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:27:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:27:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:27:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:27:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:27:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:27:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:27:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:27:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:27:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:27:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:27:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 10:27:47,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:27:47,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733542735] [2024-10-11 10:27:47,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733542735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:27:47,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:27:47,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 10:27:47,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727581963] [2024-10-11 10:27:47,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:27:47,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 10:27:47,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:27:47,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 10:27:47,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:27:47,619 INFO L87 Difference]: Start difference. First operand 376 states and 589 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:27:48,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:27:48,019 INFO L93 Difference]: Finished difference Result 998 states and 1549 transitions. [2024-10-11 10:27:48,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 10:27:48,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 208 [2024-10-11 10:27:48,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:27:48,025 INFO L225 Difference]: With dead ends: 998 [2024-10-11 10:27:48,025 INFO L226 Difference]: Without dead ends: 728 [2024-10-11 10:27:48,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-11 10:27:48,027 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 393 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:27:48,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1322 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:27:48,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2024-10-11 10:27:48,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 666. [2024-10-11 10:27:48,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 500 states have (on average 1.444) internal successors, (722), 500 states have internal predecessors, (722), 160 states have call successors, (160), 5 states have call predecessors, (160), 5 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2024-10-11 10:27:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1042 transitions. [2024-10-11 10:27:48,099 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1042 transitions. Word has length 208 [2024-10-11 10:27:48,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:27:48,100 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 1042 transitions. [2024-10-11 10:27:48,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:27:48,100 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1042 transitions. [2024-10-11 10:27:48,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-11 10:27:48,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:27:48,103 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:27:48,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 10:27:48,103 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:27:48,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:27:48,103 INFO L85 PathProgramCache]: Analyzing trace with hash 284208150, now seen corresponding path program 1 times [2024-10-11 10:27:48,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:27:48,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938781800] [2024-10-11 10:27:48,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:27:48,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:27:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:27:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:27:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:27:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:27:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:27:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:27:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:27:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:27:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:27:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:27:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:27:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:27:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:27:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:27:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:27:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:27:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:27:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:27:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:27:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:27:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:27:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:27:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:27:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:27:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:27:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:27:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:27:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:27:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:27:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:27:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:27:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:27:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 10:27:48,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:27:48,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938781800] [2024-10-11 10:27:48,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938781800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:27:48,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:27:48,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:27:48,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509716941] [2024-10-11 10:27:48,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:27:48,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:27:48,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:27:48,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:27:48,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:27:48,406 INFO L87 Difference]: Start difference. First operand 666 states and 1042 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:27:48,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:27:48,468 INFO L93 Difference]: Finished difference Result 1258 states and 1964 transitions. [2024-10-11 10:27:48,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:27:48,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 208 [2024-10-11 10:27:48,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:27:48,474 INFO L225 Difference]: With dead ends: 1258 [2024-10-11 10:27:48,474 INFO L226 Difference]: Without dead ends: 666 [2024-10-11 10:27:48,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:27:48,476 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 77 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:27:48,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 332 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:27:48,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-10-11 10:27:48,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2024-10-11 10:27:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 500 states have (on average 1.442) internal successors, (721), 500 states have internal predecessors, (721), 160 states have call successors, (160), 5 states have call predecessors, (160), 5 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2024-10-11 10:27:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1041 transitions. [2024-10-11 10:27:48,524 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1041 transitions. Word has length 208 [2024-10-11 10:27:48,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:27:48,524 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 1041 transitions. [2024-10-11 10:27:48,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:27:48,525 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1041 transitions. [2024-10-11 10:27:48,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-11 10:27:48,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:27:48,527 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:27:48,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 10:27:48,528 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:27:48,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:27:48,528 INFO L85 PathProgramCache]: Analyzing trace with hash 503062868, now seen corresponding path program 1 times [2024-10-11 10:27:48,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:27:48,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372450668] [2024-10-11 10:27:48,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:27:48,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:27:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:27:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:27:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:27:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:27:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:27:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:27:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:27:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:27:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:27:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:27:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:27:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:27:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:27:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:27:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:27:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:27:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:27:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:27:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:27:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:27:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:27:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:27:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:27:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:27:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:27:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:27:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:27:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:27:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:27:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:48,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:27:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:27:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:27:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 10:27:49,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:27:49,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372450668] [2024-10-11 10:27:49,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372450668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:27:49,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:27:49,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:27:49,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26665526] [2024-10-11 10:27:49,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:27:49,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:27:49,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:27:49,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:27:49,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:27:49,014 INFO L87 Difference]: Start difference. First operand 666 states and 1041 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:27:49,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:27:49,276 INFO L93 Difference]: Finished difference Result 1306 states and 2027 transitions. [2024-10-11 10:27:49,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:27:49,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 208 [2024-10-11 10:27:49,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:27:49,281 INFO L225 Difference]: With dead ends: 1306 [2024-10-11 10:27:49,282 INFO L226 Difference]: Without dead ends: 724 [2024-10-11 10:27:49,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:27:49,285 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 137 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:27:49,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 471 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:27:49,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-10-11 10:27:49,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 674. [2024-10-11 10:27:49,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 508 states have (on average 1.4311023622047243) internal successors, (727), 508 states have internal predecessors, (727), 160 states have call successors, (160), 5 states have call predecessors, (160), 5 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2024-10-11 10:27:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1047 transitions. [2024-10-11 10:27:49,351 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1047 transitions. Word has length 208 [2024-10-11 10:27:49,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:27:49,352 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 1047 transitions. [2024-10-11 10:27:49,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:27:49,352 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1047 transitions. [2024-10-11 10:27:49,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-11 10:27:49,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:27:49,355 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:27:49,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 10:27:49,355 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:27:49,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:27:49,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1423692727, now seen corresponding path program 1 times [2024-10-11 10:27:49,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:27:49,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858416775] [2024-10-11 10:27:49,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:27:49,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:27:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:27:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:27:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:27:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:27:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:27:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:27:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:27:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:27:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:27:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:27:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:27:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:27:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:27:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:27:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:27:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:27:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:27:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:27:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:27:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:27:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:27:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:27:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:27:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:27:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:27:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:27:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:27:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:27:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:27:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:27:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:27:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:27:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 10:27:49,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:27:49,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858416775] [2024-10-11 10:27:49,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858416775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:27:49,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:27:49,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:27:49,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727433479] [2024-10-11 10:27:49,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:27:49,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:27:49,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:27:49,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:27:49,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:27:49,720 INFO L87 Difference]: Start difference. First operand 674 states and 1047 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:27:50,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:27:50,004 INFO L93 Difference]: Finished difference Result 1748 states and 2704 transitions. [2024-10-11 10:27:50,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:27:50,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 209 [2024-10-11 10:27:50,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:27:50,012 INFO L225 Difference]: With dead ends: 1748 [2024-10-11 10:27:50,013 INFO L226 Difference]: Without dead ends: 1184 [2024-10-11 10:27:50,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:27:50,017 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 209 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:27:50,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 596 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:27:50,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2024-10-11 10:27:50,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1100. [2024-10-11 10:27:50,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 802 states have (on average 1.4102244389027432) internal successors, (1131), 802 states have internal predecessors, (1131), 288 states have call successors, (288), 9 states have call predecessors, (288), 9 states have return successors, (288), 288 states have call predecessors, (288), 288 states have call successors, (288) [2024-10-11 10:27:50,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1707 transitions. [2024-10-11 10:27:50,133 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1707 transitions. Word has length 209 [2024-10-11 10:27:50,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:27:50,135 INFO L471 AbstractCegarLoop]: Abstraction has 1100 states and 1707 transitions. [2024-10-11 10:27:50,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:27:50,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1707 transitions. [2024-10-11 10:27:50,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-11 10:27:50,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:27:50,138 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:27:50,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 10:27:50,138 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:27:50,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:27:50,138 INFO L85 PathProgramCache]: Analyzing trace with hash -969818518, now seen corresponding path program 1 times [2024-10-11 10:27:50,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:27:50,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552613018] [2024-10-11 10:27:50,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:27:50,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:27:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:27:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:27:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:27:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:27:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:27:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:27:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:27:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:27:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:27:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:27:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:27:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:27:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:27:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:27:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:27:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:27:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:27:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:27:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:27:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:27:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:27:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:27:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:27:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:27:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:27:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:27:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:27:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:27:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:27:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:27:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:27:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:27:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 60 proven. 33 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-11 10:27:50,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:27:50,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552613018] [2024-10-11 10:27:50,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552613018] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:27:50,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509769557] [2024-10-11 10:27:50,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:27:50,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:27:50,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:27:50,441 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:27:50,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 10:27:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:50,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 10:27:50,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:27:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 951 proven. 33 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2024-10-11 10:27:50,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:27:51,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 60 proven. 33 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-11 10:27:51,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509769557] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:27:51,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 10:27:51,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-11 10:27:51,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005948113] [2024-10-11 10:27:51,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 10:27:51,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 10:27:51,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:27:51,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 10:27:51,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 10:27:51,084 INFO L87 Difference]: Start difference. First operand 1100 states and 1707 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-10-11 10:27:51,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:27:51,423 INFO L93 Difference]: Finished difference Result 2194 states and 3364 transitions. [2024-10-11 10:27:51,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 10:27:51,424 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 214 [2024-10-11 10:27:51,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:27:51,432 INFO L225 Difference]: With dead ends: 2194 [2024-10-11 10:27:51,433 INFO L226 Difference]: Without dead ends: 1154 [2024-10-11 10:27:51,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 487 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:27:51,437 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 207 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:27:51,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 305 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:27:51,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-10-11 10:27:51,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1136. [2024-10-11 10:27:51,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 829 states have (on average 1.353437876960193) internal successors, (1122), 829 states have internal predecessors, (1122), 288 states have call successors, (288), 18 states have call predecessors, (288), 18 states have return successors, (288), 288 states have call predecessors, (288), 288 states have call successors, (288) [2024-10-11 10:27:51,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1698 transitions. [2024-10-11 10:27:51,576 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1698 transitions. Word has length 214 [2024-10-11 10:27:51,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:27:51,576 INFO L471 AbstractCegarLoop]: Abstraction has 1136 states and 1698 transitions. [2024-10-11 10:27:51,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-10-11 10:27:51,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1698 transitions. [2024-10-11 10:27:51,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-11 10:27:51,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:27:51,581 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:27:51,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 10:27:51,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 10:27:51,786 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:27:51,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:27:51,786 INFO L85 PathProgramCache]: Analyzing trace with hash -844857880, now seen corresponding path program 1 times [2024-10-11 10:27:51,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:27:51,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491197893] [2024-10-11 10:27:51,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:27:51,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:27:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:27:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:27:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:27:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:27:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:27:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:27:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:27:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:27:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:27:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:27:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:27:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:27:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:27:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:27:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:27:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:27:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:27:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:27:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:27:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:27:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:27:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:27:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:27:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:27:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:27:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:27:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:27:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:27:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:27:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:27:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:27:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:27:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:51,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 10:27:51,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:27:51,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491197893] [2024-10-11 10:27:51,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491197893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:27:51,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:27:51,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:27:51,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121373855] [2024-10-11 10:27:51,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:27:51,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:27:51,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:27:51,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:27:51,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:27:51,928 INFO L87 Difference]: Start difference. First operand 1136 states and 1698 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:27:52,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:27:52,132 INFO L93 Difference]: Finished difference Result 3100 states and 4605 transitions. [2024-10-11 10:27:52,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:27:52,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 217 [2024-10-11 10:27:52,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:27:52,148 INFO L225 Difference]: With dead ends: 3100 [2024-10-11 10:27:52,149 INFO L226 Difference]: Without dead ends: 2033 [2024-10-11 10:27:52,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:27:52,155 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 133 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:27:52,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 372 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:27:52,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2024-10-11 10:27:52,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2023. [2024-10-11 10:27:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2023 states, 1523 states have (on average 1.3493105712409719) internal successors, (2055), 1531 states have internal predecessors, (2055), 464 states have call successors, (464), 35 states have call predecessors, (464), 35 states have return successors, (464), 456 states have call predecessors, (464), 464 states have call successors, (464) [2024-10-11 10:27:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 2023 states and 2983 transitions. [2024-10-11 10:27:52,409 INFO L78 Accepts]: Start accepts. Automaton has 2023 states and 2983 transitions. Word has length 217 [2024-10-11 10:27:52,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:27:52,410 INFO L471 AbstractCegarLoop]: Abstraction has 2023 states and 2983 transitions. [2024-10-11 10:27:52,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:27:52,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2983 transitions. [2024-10-11 10:27:52,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-11 10:27:52,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:27:52,413 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:27:52,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 10:27:52,413 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:27:52,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:27:52,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1239224666, now seen corresponding path program 1 times [2024-10-11 10:27:52,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:27:52,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206744703] [2024-10-11 10:27:52,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:27:52,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:27:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:27:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:27:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:27:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:27:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:27:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:27:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:27:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:27:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:27:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:27:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:27:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:27:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:27:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:27:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:27:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:27:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:27:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:27:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:27:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:27:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:27:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:27:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:27:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:27:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:27:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:27:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:27:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:27:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:27:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:27:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:27:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:27:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 66 proven. 27 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-11 10:27:52,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:27:52,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206744703] [2024-10-11 10:27:52,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206744703] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:27:52,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304721963] [2024-10-11 10:27:52,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:27:52,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:27:52,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:27:52,747 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:27:52,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 10:27:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:52,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 10:27:52,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:27:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 867 proven. 27 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2024-10-11 10:27:53,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:27:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 66 proven. 27 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-11 10:27:53,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304721963] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:27:53,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 10:27:53,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-11 10:27:53,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814531434] [2024-10-11 10:27:53,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 10:27:53,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 10:27:53,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:27:53,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 10:27:53,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 10:27:53,329 INFO L87 Difference]: Start difference. First operand 2023 states and 2983 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-10-11 10:27:53,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:27:53,792 INFO L93 Difference]: Finished difference Result 3197 states and 4652 transitions. [2024-10-11 10:27:53,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 10:27:53,793 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 217 [2024-10-11 10:27:53,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:27:53,802 INFO L225 Difference]: With dead ends: 3197 [2024-10-11 10:27:53,803 INFO L226 Difference]: Without dead ends: 1244 [2024-10-11 10:27:53,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 493 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:27:53,810 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 207 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:27:53,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 293 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:27:53,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2024-10-11 10:27:53,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1208. [2024-10-11 10:27:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 883 states have (on average 1.3012457531143828) internal successors, (1149), 883 states have internal predecessors, (1149), 288 states have call successors, (288), 36 states have call predecessors, (288), 36 states have return successors, (288), 288 states have call predecessors, (288), 288 states have call successors, (288) [2024-10-11 10:27:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1725 transitions. [2024-10-11 10:27:53,963 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1725 transitions. Word has length 217 [2024-10-11 10:27:53,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:27:53,964 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1725 transitions. [2024-10-11 10:27:53,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-10-11 10:27:53,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1725 transitions. [2024-10-11 10:27:53,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-11 10:27:53,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:27:53,966 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:27:53,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 10:27:54,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:27:54,168 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:27:54,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:27:54,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1420170403, now seen corresponding path program 1 times [2024-10-11 10:27:54,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:27:54,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021225365] [2024-10-11 10:27:54,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:27:54,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:27:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:27:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:27:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:27:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:27:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:27:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:27:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:27:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:27:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:27:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:27:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:27:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:27:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:27:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:27:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:27:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:27:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:27:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:27:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:27:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:27:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:27:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:27:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:27:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:27:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:27:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:27:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:27:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:27:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:27:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:27:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:27:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:27:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:54,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 10:27:54,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:27:54,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021225365] [2024-10-11 10:27:54,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021225365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:27:54,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:27:54,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:27:54,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695478501] [2024-10-11 10:27:54,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:27:54,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:27:54,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:27:54,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:27:54,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:27:54,360 INFO L87 Difference]: Start difference. First operand 1208 states and 1725 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:27:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:27:54,497 INFO L93 Difference]: Finished difference Result 2347 states and 3359 transitions. [2024-10-11 10:27:54,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:27:54,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 219 [2024-10-11 10:27:54,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:27:54,507 INFO L225 Difference]: With dead ends: 2347 [2024-10-11 10:27:54,507 INFO L226 Difference]: Without dead ends: 1217 [2024-10-11 10:27:54,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:27:54,513 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:27:54,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:27:54,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2024-10-11 10:27:54,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1217. [2024-10-11 10:27:54,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 892 states have (on average 1.298206278026906) internal successors, (1158), 892 states have internal predecessors, (1158), 288 states have call successors, (288), 36 states have call predecessors, (288), 36 states have return successors, (288), 288 states have call predecessors, (288), 288 states have call successors, (288) [2024-10-11 10:27:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1734 transitions. [2024-10-11 10:27:54,660 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1734 transitions. Word has length 219 [2024-10-11 10:27:54,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:27:54,660 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1734 transitions. [2024-10-11 10:27:54,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:27:54,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1734 transitions. [2024-10-11 10:27:54,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-11 10:27:54,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:27:54,663 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:27:54,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 10:27:54,663 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:27:54,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:27:54,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2121770277, now seen corresponding path program 1 times [2024-10-11 10:27:54,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:27:54,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413114392] [2024-10-11 10:27:54,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:27:54,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:27:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:27:54,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1986142559] [2024-10-11 10:27:54,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:27:54,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:27:54,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:27:54,806 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:27:54,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 10:27:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:55,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 10:27:55,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:27:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 373 proven. 84 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2024-10-11 10:27:55,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:27:56,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:27:56,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413114392] [2024-10-11 10:27:56,909 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 10:27:56,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986142559] [2024-10-11 10:27:56,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986142559] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:27:56,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 10:27:56,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-10-11 10:27:56,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390494868] [2024-10-11 10:27:56,911 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 10:27:56,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 10:27:56,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:27:56,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 10:27:56,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:27:56,912 INFO L87 Difference]: Start difference. First operand 1217 states and 1734 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 10:27:57,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:27:57,695 INFO L93 Difference]: Finished difference Result 3127 states and 4394 transitions. [2024-10-11 10:27:57,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 10:27:57,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 219 [2024-10-11 10:27:57,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:27:57,708 INFO L225 Difference]: With dead ends: 3127 [2024-10-11 10:27:57,708 INFO L226 Difference]: Without dead ends: 2039 [2024-10-11 10:27:57,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2024-10-11 10:27:57,714 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 164 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:27:57,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 636 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 10:27:57,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2024-10-11 10:27:57,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 1955. [2024-10-11 10:27:57,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1955 states, 1452 states have (on average 1.296831955922865) internal successors, (1883), 1460 states have internal predecessors, (1883), 432 states have call successors, (432), 70 states have call predecessors, (432), 70 states have return successors, (432), 424 states have call predecessors, (432), 432 states have call successors, (432) [2024-10-11 10:27:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 2747 transitions. [2024-10-11 10:27:57,922 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 2747 transitions. Word has length 219 [2024-10-11 10:27:57,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:27:57,923 INFO L471 AbstractCegarLoop]: Abstraction has 1955 states and 2747 transitions. [2024-10-11 10:27:57,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 10:27:57,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2747 transitions. [2024-10-11 10:27:57,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-11 10:27:57,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:27:57,925 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:27:57,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 10:27:58,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:27:58,131 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:27:58,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:27:58,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1443943785, now seen corresponding path program 1 times [2024-10-11 10:27:58,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:27:58,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341415479] [2024-10-11 10:27:58,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:27:58,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:27:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:27:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:27:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:27:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:27:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:27:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:27:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:27:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:27:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:27:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:27:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:27:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:27:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:27:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:27:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:27:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:27:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:27:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:27:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:27:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:27:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:27:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:27:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:27:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:27:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:27:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:27:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:27:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:27:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:27:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:27:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:27:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:27:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:27:58,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 10:27:58,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:27:58,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341415479] [2024-10-11 10:27:58,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341415479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:27:58,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:27:58,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:27:58,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317548164] [2024-10-11 10:27:58,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:27:58,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:27:58,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:27:58,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:27:58,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:27:58,527 INFO L87 Difference]: Start difference. First operand 1955 states and 2747 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:27:58,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:27:58,806 INFO L93 Difference]: Finished difference Result 3367 states and 4764 transitions. [2024-10-11 10:27:58,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:27:58,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 219 [2024-10-11 10:27:58,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:27:58,825 INFO L225 Difference]: With dead ends: 3367 [2024-10-11 10:27:58,825 INFO L226 Difference]: Without dead ends: 2752 [2024-10-11 10:27:58,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:27:58,831 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 96 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:27:58,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 486 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:27:58,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2024-10-11 10:27:59,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 1956. [2024-10-11 10:27:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1956 states, 1453 states have (on average 1.296627666896077) internal successors, (1884), 1461 states have internal predecessors, (1884), 432 states have call successors, (432), 70 states have call predecessors, (432), 70 states have return successors, (432), 424 states have call predecessors, (432), 432 states have call successors, (432) [2024-10-11 10:27:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2748 transitions. [2024-10-11 10:27:59,080 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2748 transitions. Word has length 219 [2024-10-11 10:27:59,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:27:59,081 INFO L471 AbstractCegarLoop]: Abstraction has 1956 states and 2748 transitions. [2024-10-11 10:27:59,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:27:59,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2748 transitions. [2024-10-11 10:27:59,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-11 10:27:59,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:27:59,084 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:27:59,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 10:27:59,084 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:27:59,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:27:59,085 INFO L85 PathProgramCache]: Analyzing trace with hash 432826535, now seen corresponding path program 1 times [2024-10-11 10:27:59,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:27:59,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519362916] [2024-10-11 10:27:59,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:27:59,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:27:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:27:59,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [93500504] [2024-10-11 10:27:59,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:27:59,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:27:59,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:27:59,199 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:27:59,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 10:27:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:27:59,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:27:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:27:59,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:27:59,618 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:27:59,619 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:27:59,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 10:27:59,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 10:27:59,825 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:27:59,966 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:27:59,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:27:59 BoogieIcfgContainer [2024-10-11 10:27:59,969 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:27:59,970 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:27:59,970 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:27:59,970 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:27:59,971 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:27:43" (3/4) ... [2024-10-11 10:27:59,973 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:27:59,975 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:27:59,975 INFO L158 Benchmark]: Toolchain (without parser) took 18463.23ms. Allocated memory was 180.4MB in the beginning and 536.9MB in the end (delta: 356.5MB). Free memory was 123.9MB in the beginning and 298.2MB in the end (delta: -174.3MB). Peak memory consumption was 185.2MB. Max. memory is 16.1GB. [2024-10-11 10:27:59,975 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 180.4MB. Free memory is still 146.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:27:59,976 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.83ms. Allocated memory is still 180.4MB. Free memory was 123.6MB in the beginning and 103.8MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 10:27:59,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.60ms. Allocated memory is still 180.4MB. Free memory was 103.5MB in the beginning and 94.9MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 10:27:59,977 INFO L158 Benchmark]: Boogie Preprocessor took 121.60ms. Allocated memory is still 180.4MB. Free memory was 94.9MB in the beginning and 82.3MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 10:27:59,977 INFO L158 Benchmark]: RCFGBuilder took 948.68ms. Allocated memory was 180.4MB in the beginning and 247.5MB in the end (delta: 67.1MB). Free memory was 82.0MB in the beginning and 184.7MB in the end (delta: -102.7MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2024-10-11 10:27:59,978 INFO L158 Benchmark]: TraceAbstraction took 16807.57ms. Allocated memory was 247.5MB in the beginning and 536.9MB in the end (delta: 289.4MB). Free memory was 183.6MB in the beginning and 298.2MB in the end (delta: -114.5MB). Peak memory consumption was 175.8MB. Max. memory is 16.1GB. [2024-10-11 10:27:59,978 INFO L158 Benchmark]: Witness Printer took 4.90ms. Allocated memory is still 536.9MB. Free memory is still 298.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:27:59,982 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.22ms. Allocated memory is still 180.4MB. Free memory is still 146.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 487.83ms. Allocated memory is still 180.4MB. Free memory was 123.6MB in the beginning and 103.8MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.60ms. Allocated memory is still 180.4MB. Free memory was 103.5MB in the beginning and 94.9MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 121.60ms. Allocated memory is still 180.4MB. Free memory was 94.9MB in the beginning and 82.3MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 948.68ms. Allocated memory was 180.4MB in the beginning and 247.5MB in the end (delta: 67.1MB). Free memory was 82.0MB in the beginning and 184.7MB in the end (delta: -102.7MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16807.57ms. Allocated memory was 247.5MB in the beginning and 536.9MB in the end (delta: 289.4MB). Free memory was 183.6MB in the beginning and 298.2MB in the end (delta: -114.5MB). Peak memory consumption was 175.8MB. Max. memory is 16.1GB. * Witness Printer took 4.90ms. Allocated memory is still 536.9MB. Free memory is still 298.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of bitwiseOr at line 187, overapproximation of someBinaryArithmeticDOUBLEoperation at line 111. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_3 = 64; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 2; [L26] unsigned short int var_1_6 = 10; [L27] double var_1_8 = 1.875; [L28] signed long int var_1_9 = -4; [L29] double var_1_10 = 63.5; [L30] double var_1_11 = 255.375; [L31] double var_1_12 = 999999999.525; [L32] double var_1_13 = 63.75; [L33] double var_1_14 = 0.625; [L34] unsigned short int var_1_15 = 5; [L35] signed char var_1_16 = 4; [L36] signed char var_1_17 = 0; [L37] signed char var_1_18 = -2; [L38] signed char var_1_19 = 1; [L39] unsigned short int var_1_20 = 50; [L40] unsigned short int var_1_21 = 0; [L41] unsigned char var_1_22 = 2; [L42] unsigned char var_1_23 = 32; [L43] unsigned short int var_1_24 = 8; [L44] unsigned short int var_1_26 = 26914; [L45] unsigned short int var_1_27 = 26182; [L46] unsigned char var_1_28 = 5; [L47] unsigned char var_1_29 = 50; [L48] unsigned char var_1_30 = 10; [L49] signed long int var_1_31 = -32; [L50] unsigned char var_1_32 = 0; [L51] unsigned char var_1_33 = 1; [L52] unsigned char var_1_34 = 0; [L53] signed long int var_1_35 = 1000000; [L54] signed long int var_1_36 = 64; [L55] unsigned char last_1_var_1_3 = 64; [L56] unsigned short int last_1_var_1_6 = 10; [L57] unsigned short int last_1_var_1_15 = 5; [L58] unsigned short int last_1_var_1_20 = 50; [L59] unsigned short int last_1_var_1_21 = 0; [L191] isInitial = 1 [L192] FCALL initially() [L193] COND TRUE 1 [L194] CALL updateLastVariables() [L180] last_1_var_1_3 = var_1_3 [L181] last_1_var_1_6 = var_1_6 [L182] last_1_var_1_15 = var_1_15 [L183] last_1_var_1_20 = var_1_20 [L184] last_1_var_1_21 = var_1_21 [L194] RET updateLastVariables() [L195] CALL updateVariables() [L128] var_1_4 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L129] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L130] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L130] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L131] var_1_5 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L132] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L133] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L133] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L134] var_1_9 = __VERIFIER_nondet_long() [L135] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L135] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L136] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L136] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L137] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L137] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L138] var_1_10 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L139] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L140] var_1_11 = __VERIFIER_nondet_double() [L141] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L141] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L142] var_1_12 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L143] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L144] var_1_13 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L145] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L146] var_1_14 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L147] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L148] var_1_17 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L149] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L150] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L150] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L151] var_1_18 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L152] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L153] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L153] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L154] var_1_19 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_19 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L155] RET assume_abort_if_not(var_1_19 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L156] CALL assume_abort_if_not(var_1_19 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L156] RET assume_abort_if_not(var_1_19 <= 31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L157] var_1_23 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L158] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L159] CALL assume_abort_if_not(var_1_23 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L159] RET assume_abort_if_not(var_1_23 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L160] var_1_26 = __VERIFIER_nondet_ushort() [L161] CALL assume_abort_if_not(var_1_26 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L161] RET assume_abort_if_not(var_1_26 >= 16383) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L162] CALL assume_abort_if_not(var_1_26 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L162] RET assume_abort_if_not(var_1_26 <= 32767) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L163] var_1_27 = __VERIFIER_nondet_ushort() [L164] CALL assume_abort_if_not(var_1_27 >= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L164] RET assume_abort_if_not(var_1_27 >= 16384) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L165] CALL assume_abort_if_not(var_1_27 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L165] RET assume_abort_if_not(var_1_27 <= 32767) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L166] var_1_29 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L167] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L168] CALL assume_abort_if_not(var_1_29 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L168] RET assume_abort_if_not(var_1_29 <= 127) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L169] var_1_30 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L170] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L171] CALL assume_abort_if_not(var_1_30 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L171] RET assume_abort_if_not(var_1_30 <= 127) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L172] var_1_33 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_33 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L173] RET assume_abort_if_not(var_1_33 >= 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L174] CALL assume_abort_if_not(var_1_33 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L174] RET assume_abort_if_not(var_1_33 <= 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L175] var_1_34 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L176] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L177] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L177] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L195] RET updateVariables() [L196] CALL step() [L63] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=8, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L64] COND TRUE ((((var_1_6) < (var_1_23)) ? (var_1_6) : (var_1_23))) >= var_1_15 [L65] var_1_24 = ((var_1_26 + var_1_27) - var_1_23) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L67] COND TRUE var_1_27 > 0 [L68] var_1_28 = (((((((((var_1_29 + var_1_30)) > (var_1_23)) ? ((var_1_29 + var_1_30)) : (var_1_23)))) < (0)) ? ((((((var_1_29 + var_1_30)) > (var_1_23)) ? ((var_1_29 + var_1_30)) : (var_1_23)))) : (0))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L70] COND TRUE var_1_26 != 10 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L71] COND FALSE !(var_1_26 <= var_1_29) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L75] COND TRUE var_1_26 > 100 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L76] EXPR ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) ^ var_1_26 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L76] COND FALSE !((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) ^ var_1_26) > var_1_21) [L79] var_1_32 = var_1_34 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L82] var_1_35 = ((((var_1_26) > (((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) ? (var_1_26) : (((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3)))))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L83] COND FALSE !(var_1_29 > var_1_30) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L90] COND FALSE !(var_1_16 >= var_1_6) [L93] var_1_36 = var_1_23 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L96] signed long int stepLocal_0 = last_1_var_1_21; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_0=0, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L97] COND FALSE !(last_1_var_1_6 < stepLocal_0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L100] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L100] signed long int stepLocal_2 = last_1_var_1_20 ^ last_1_var_1_15; [L101] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=129, stepLocal_2=1, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L102] COND FALSE !(stepLocal_2 < -256) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=129, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L105] COND FALSE !(stepLocal_1 <= 50) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L109] var_1_20 = (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=139, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_8=15/8, var_1_9=130] [L110] COND TRUE var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9)))) [L111] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=139, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_9=130] [L117] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) [L118] var_1_1 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) [L119] unsigned short int stepLocal_3 = var_1_6; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=139, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_9=130] [L120] EXPR (var_1_3 * var_1_17) & (var_1_1 * var_1_18) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=139, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_9=130] [L120] COND FALSE !(stepLocal_3 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) [L123] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21 [L124] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=268, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=139, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_9=130] [L196] RET step() [L197] CALL, EXPR property() [L187] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=268, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=139, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_9=130] [L187] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=268, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=139, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_9=130] [L187] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=268, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=139, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_9=130] [L187] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=268, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=139, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_9=130] [L187-L188] return (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) ; [L197] RET, EXPR property() [L197] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=268, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=139, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_9=130] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=268, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=139, var_1_21=0, var_1_22=10, var_1_23=10, var_1_24=32758, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=10, var_1_3=64, var_1_4=139, var_1_5=129, var_1_6=10, var_1_9=130] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 16, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2042 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1996 mSDsluCounter, 7601 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5058 mSDsCounter, 607 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1547 IncrementalHoareTripleChecker+Invalid, 2154 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 607 mSolverCounterUnsat, 2543 mSDtfsCounter, 1547 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2135 GetRequests, 2058 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2023occurred in iteration=11, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 1191 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 4254 NumberOfCodeBlocks, 4254 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 4009 ConstructedInterpolants, 0 QuantifiedInterpolants, 10194 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1484 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 37432/37696 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 10:28:00,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1380cfc36c62c1d753945810f92d4eba7bc79d804922edbd332f86c5fd94ebd5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:28:02,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:28:02,478 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:28:02,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:28:02,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:28:02,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:28:02,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:28:02,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:28:02,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:28:02,523 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:28:02,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:28:02,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:28:02,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:28:02,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:28:02,528 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:28:02,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:28:02,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:28:02,530 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:28:02,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:28:02,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:28:02,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:28:02,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:28:02,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:28:02,532 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:28:02,532 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:28:02,532 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:28:02,533 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:28:02,533 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:28:02,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:28:02,533 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:28:02,536 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:28:02,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:28:02,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:28:02,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:28:02,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:28:02,537 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:28:02,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:28:02,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:28:02,538 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:28:02,538 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:28:02,538 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:28:02,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:28:02,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:28:02,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:28:02,540 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:28:02,540 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1380cfc36c62c1d753945810f92d4eba7bc79d804922edbd332f86c5fd94ebd5 [2024-10-11 10:28:02,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:28:02,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:28:02,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:28:02,928 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:28:02,929 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:28:02,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i [2024-10-11 10:28:04,556 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:28:04,792 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:28:04,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i [2024-10-11 10:28:04,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4b2e0c9af/eb6482a73683476ea26ee60c16cf3bcb/FLAG3d14d0ab9 [2024-10-11 10:28:04,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4b2e0c9af/eb6482a73683476ea26ee60c16cf3bcb [2024-10-11 10:28:04,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:28:04,823 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:28:04,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:28:04,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:28:04,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:28:04,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:28:04" (1/1) ... [2024-10-11 10:28:04,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7587020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:04, skipping insertion in model container [2024-10-11 10:28:04,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:28:04" (1/1) ... [2024-10-11 10:28:04,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:28:05,055 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_fillercode_fillercodestructure_filler-ps-co_file-78.i[919,932] [2024-10-11 10:28:05,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:28:05,185 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:28:05,198 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_fillercode_fillercodestructure_filler-ps-co_file-78.i[919,932] [2024-10-11 10:28:05,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:28:05,271 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:28:05,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:05 WrapperNode [2024-10-11 10:28:05,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:28:05,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:28:05,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:28:05,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:28:05,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:05" (1/1) ... [2024-10-11 10:28:05,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:05" (1/1) ... [2024-10-11 10:28:05,358 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-10-11 10:28:05,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:28:05,362 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:28:05,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:28:05,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:28:05,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:05" (1/1) ... [2024-10-11 10:28:05,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:05" (1/1) ... [2024-10-11 10:28:05,382 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:05" (1/1) ... [2024-10-11 10:28:05,415 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:28:05,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:05" (1/1) ... [2024-10-11 10:28:05,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:05" (1/1) ... [2024-10-11 10:28:05,434 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:05" (1/1) ... [2024-10-11 10:28:05,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:05" (1/1) ... [2024-10-11 10:28:05,447 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:05" (1/1) ... [2024-10-11 10:28:05,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:05" (1/1) ... [2024-10-11 10:28:05,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:28:05,458 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:28:05,458 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:28:05,458 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:28:05,459 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:05" (1/1) ... [2024-10-11 10:28:05,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:28:05,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:28:05,491 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:28:05,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:28:05,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:28:05,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:28:05,542 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:28:05,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:28:05,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:28:05,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:28:05,652 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:28:05,655 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:28:11,942 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 10:28:11,942 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:28:11,996 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:28:11,996 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:28:11,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:28:11 BoogieIcfgContainer [2024-10-11 10:28:11,997 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:28:11,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:28:11,999 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:28:12,003 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:28:12,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:28:04" (1/3) ... [2024-10-11 10:28:12,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb36a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:28:12, skipping insertion in model container [2024-10-11 10:28:12,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:28:05" (2/3) ... [2024-10-11 10:28:12,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb36a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:28:12, skipping insertion in model container [2024-10-11 10:28:12,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:28:11" (3/3) ... [2024-10-11 10:28:12,007 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-78.i [2024-10-11 10:28:12,026 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:28:12,027 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:28:12,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:28:12,106 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;@391e80c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:28:12,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:28:12,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 50 states have internal predecessors, (70), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 10:28:12,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 10:28:12,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:28:12,127 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:28:12,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:28:12,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:28:12,133 INFO L85 PathProgramCache]: Analyzing trace with hash -178584841, now seen corresponding path program 1 times [2024-10-11 10:28:12,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:28:12,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882036882] [2024-10-11 10:28:12,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:28:12,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:28:12,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:28:12,154 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:28:12,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 10:28:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:28:12,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:28:12,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:28:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 902 proven. 0 refuted. 0 times theorem prover too weak. 1082 trivial. 0 not checked. [2024-10-11 10:28:12,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:28:12,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:28:12,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882036882] [2024-10-11 10:28:12,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882036882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:28:12,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:28:12,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:28:12,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879009148] [2024-10-11 10:28:12,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:28:12,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:28:12,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:28:12,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:28:12,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:28:12,714 INFO L87 Difference]: Start difference. First operand has 84 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 50 states have internal predecessors, (70), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 10:28:16,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:28:16,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:28:16,899 INFO L93 Difference]: Finished difference Result 165 states and 298 transitions. [2024-10-11 10:28:16,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:28:16,933 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 199 [2024-10-11 10:28:16,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:28:16,943 INFO L225 Difference]: With dead ends: 165 [2024-10-11 10:28:16,943 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 10:28:16,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 198 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-11 10:28:16,950 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:28:16,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 10:28:16,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 10:28:16,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-11 10:28:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 10:28:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 129 transitions. [2024-10-11 10:28:17,004 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 129 transitions. Word has length 199 [2024-10-11 10:28:17,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:28:17,004 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 129 transitions. [2024-10-11 10:28:17,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 10:28:17,005 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 129 transitions. [2024-10-11 10:28:17,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 10:28:17,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:28:17,014 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:28:17,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 10:28:17,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:28:17,215 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:28:17,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:28:17,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1161151811, now seen corresponding path program 1 times [2024-10-11 10:28:17,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:28:17,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790563093] [2024-10-11 10:28:17,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:28:17,218 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:28:17,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:28:17,220 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:28:17,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 10:28:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:28:17,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 10:28:17,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:28:19,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 964 proven. 60 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2024-10-11 10:28:19,591 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:28:20,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 60 proven. 33 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-11 10:28:20,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:28:20,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790563093] [2024-10-11 10:28:20,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790563093] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:28:20,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 10:28:20,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2024-10-11 10:28:20,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561883159] [2024-10-11 10:28:20,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 10:28:20,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 10:28:20,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:28:20,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 10:28:20,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:28:20,822 INFO L87 Difference]: Start difference. First operand 82 states and 129 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2024-10-11 10:28:26,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:28:28,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:28:28,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:28:28,580 INFO L93 Difference]: Finished difference Result 173 states and 265 transitions. [2024-10-11 10:28:28,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 10:28:28,619 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) Word has length 199 [2024-10-11 10:28:28,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:28:28,622 INFO L225 Difference]: With dead ends: 173 [2024-10-11 10:28:28,622 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 10:28:28,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2024-10-11 10:28:28,625 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 120 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:28:28,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 184 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 194 Invalid, 1 Unknown, 0 Unchecked, 7.5s Time] [2024-10-11 10:28:28,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 10:28:28,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2024-10-11 10:28:28,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 10:28:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2024-10-11 10:28:28,650 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 199 [2024-10-11 10:28:28,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:28:28,651 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2024-10-11 10:28:28,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2024-10-11 10:28:28,652 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2024-10-11 10:28:28,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-11 10:28:28,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:28:28,657 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:28:28,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 10:28:28,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:28:28,858 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:28:28,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:28:28,861 INFO L85 PathProgramCache]: Analyzing trace with hash 537160743, now seen corresponding path program 1 times [2024-10-11 10:28:28,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:28:28,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878455380] [2024-10-11 10:28:28,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:28:28,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:28:28,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:28:28,869 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:28:28,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 10:28:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:28:29,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 10:28:29,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:28:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 10:28:33,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:28:33,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:28:33,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878455380] [2024-10-11 10:28:33,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878455380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:28:33,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:28:33,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:28:33,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602646703] [2024-10-11 10:28:33,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:28:33,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:28:33,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:28:33,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:28:33,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:28:33,510 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:28:37,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:28:38,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:28:39,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:28:39,039 INFO L93 Difference]: Finished difference Result 261 states and 385 transitions. [2024-10-11 10:28:39,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:28:39,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 201 [2024-10-11 10:28:39,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:28:39,043 INFO L225 Difference]: With dead ends: 261 [2024-10-11 10:28:39,043 INFO L226 Difference]: Without dead ends: 172 [2024-10-11 10:28:39,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:28:39,045 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 18 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:28:39,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 239 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2024-10-11 10:28:39,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-11 10:28:39,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2024-10-11 10:28:39,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 91 states have (on average 1.1978021978021978) internal successors, (109), 91 states have internal predecessors, (109), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 10:28:39,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 237 transitions. [2024-10-11 10:28:39,089 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 237 transitions. Word has length 201 [2024-10-11 10:28:39,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:28:39,090 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 237 transitions. [2024-10-11 10:28:39,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:28:39,091 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 237 transitions. [2024-10-11 10:28:39,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-11 10:28:39,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:28:39,094 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:28:39,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 10:28:39,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:28:39,295 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:28:39,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:28:39,296 INFO L85 PathProgramCache]: Analyzing trace with hash -49645271, now seen corresponding path program 1 times [2024-10-11 10:28:39,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:28:39,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456282475] [2024-10-11 10:28:39,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:28:39,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:28:39,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:28:39,300 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:28:39,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 10:28:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:28:39,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 10:28:39,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:28:43,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 10:28:43,268 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:28:43,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:28:43,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456282475] [2024-10-11 10:28:43,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456282475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:28:43,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:28:43,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:28:43,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168256694] [2024-10-11 10:28:43,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:28:43,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:28:43,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:28:43,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:28:43,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:28:43,274 INFO L87 Difference]: Start difference. First operand 162 states and 237 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 10:28:48,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:28:51,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:28:55,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:28:57,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []