./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-15.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ffd456b3aee4a03e3ad29674b9135df7e42dac45ab32681ea39048340b5ac3f8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:16:49,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:16:49,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:16:49,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:16:49,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:16:49,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:16:49,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:16:49,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:16:49,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:16:49,092 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:16:49,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:16:49,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:16:49,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:16:49,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:16:49,095 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:16:49,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:16:49,096 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:16:49,096 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:16:49,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:16:49,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:16:49,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:16:49,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:16:49,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:16:49,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:16:49,099 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:16:49,101 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:16:49,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:16:49,101 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:16:49,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:16:49,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:16:49,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:16:49,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:16:49,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:16:49,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:16:49,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:16:49,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:16:49,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:16:49,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:16:49,103 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:16:49,103 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:16:49,103 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:16:49,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:16:49,104 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ffd456b3aee4a03e3ad29674b9135df7e42dac45ab32681ea39048340b5ac3f8 [2024-11-08 23:16:49,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:16:49,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:16:49,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:16:49,319 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:16:49,319 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:16:49,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-15.i [2024-11-08 23:16:50,567 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:16:50,731 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:16:50,732 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-15.i [2024-11-08 23:16:50,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5af7407d9/d5044a1e63864a0ba76c9d55ce94ebff/FLAG272b44b84 [2024-11-08 23:16:50,749 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5af7407d9/d5044a1e63864a0ba76c9d55ce94ebff [2024-11-08 23:16:50,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:16:50,751 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:16:50,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:16:50,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:16:50,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:16:50,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:16:50" (1/1) ... [2024-11-08 23:16:50,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63751f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:50, skipping insertion in model container [2024-11-08 23:16:50,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:16:50" (1/1) ... [2024-11-08 23:16:50,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:16:50,918 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-15.i[916,929] [2024-11-08 23:16:51,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:16:51,026 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:16:51,034 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-15.i[916,929] [2024-11-08 23:16:51,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:16:51,086 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:16:51,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:51 WrapperNode [2024-11-08 23:16:51,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:16:51,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:16:51,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:16:51,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:16:51,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:51" (1/1) ... [2024-11-08 23:16:51,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:51" (1/1) ... [2024-11-08 23:16:51,141 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 268 [2024-11-08 23:16:51,141 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:16:51,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:16:51,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:16:51,142 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:16:51,150 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:51" (1/1) ... [2024-11-08 23:16:51,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:51" (1/1) ... [2024-11-08 23:16:51,156 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:51" (1/1) ... [2024-11-08 23:16:51,179 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-11-08 23:16:51,183 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:51" (1/1) ... [2024-11-08 23:16:51,183 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:51" (1/1) ... [2024-11-08 23:16:51,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:51" (1/1) ... [2024-11-08 23:16:51,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:51" (1/1) ... [2024-11-08 23:16:51,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:51" (1/1) ... [2024-11-08 23:16:51,198 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:51" (1/1) ... [2024-11-08 23:16:51,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:16:51,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:16:51,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:16:51,202 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:16:51,206 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:51" (1/1) ... [2024-11-08 23:16:51,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:16:51,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:16:51,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:16:51,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:16:51,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:16:51,282 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:16:51,283 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:16:51,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:16:51,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:16:51,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:16:51,358 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:16:51,362 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:16:51,737 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-08 23:16:51,737 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:16:51,751 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:16:51,751 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:16:51,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:16:51 BoogieIcfgContainer [2024-11-08 23:16:51,751 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:16:51,755 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:16:51,755 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:16:51,757 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:16:51,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:16:50" (1/3) ... [2024-11-08 23:16:51,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c67871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:16:51, skipping insertion in model container [2024-11-08 23:16:51,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:51" (2/3) ... [2024-11-08 23:16:51,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c67871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:16:51, skipping insertion in model container [2024-11-08 23:16:51,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:16:51" (3/3) ... [2024-11-08 23:16:51,759 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-15.i [2024-11-08 23:16:51,771 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:16:51,771 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:16:51,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:16:51,818 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;@363754cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:16:51,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:16:51,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 23:16:51,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 23:16:51,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:16:51,835 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:16:51,835 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:16:51,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:16:51,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1438258580, now seen corresponding path program 1 times [2024-11-08 23:16:51,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:16:51,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309948770] [2024-11-08 23:16:51,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:16:51,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:16:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:16:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:16:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:16:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:16:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:16:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:16:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:16:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:16:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 23:16:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:16:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:16:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:16:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:16:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:16:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:16:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:16:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:16:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:16:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:16:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:16:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:16:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:16:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 23:16:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 23:16:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 23:16:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 23:16:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 23:16:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 23:16:52,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:16:52,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309948770] [2024-11-08 23:16:52,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309948770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:16:52,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:16:52,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:16:52,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352058213] [2024-11-08 23:16:52,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:16:52,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:16:52,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:16:52,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:16:52,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:16:52,308 INFO L87 Difference]: Start difference. First operand has 114 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 23:16:52,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:16:52,336 INFO L93 Difference]: Finished difference Result 225 states and 379 transitions. [2024-11-08 23:16:52,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:16:52,339 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 188 [2024-11-08 23:16:52,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:16:52,348 INFO L225 Difference]: With dead ends: 225 [2024-11-08 23:16:52,348 INFO L226 Difference]: Without dead ends: 110 [2024-11-08 23:16:52,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-11-08 23:16:52,354 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:16:52,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:16:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-08 23:16:52,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-08 23:16:52,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 80 states have (on average 1.425) internal successors, (114), 80 states have internal predecessors, (114), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 23:16:52,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 170 transitions. [2024-11-08 23:16:52,399 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 170 transitions. Word has length 188 [2024-11-08 23:16:52,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:16:52,399 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 170 transitions. [2024-11-08 23:16:52,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 23:16:52,400 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 170 transitions. [2024-11-08 23:16:52,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 23:16:52,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:16:52,404 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:16:52,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:16:52,405 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:16:52,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:16:52,406 INFO L85 PathProgramCache]: Analyzing trace with hash -291026148, now seen corresponding path program 1 times [2024-11-08 23:16:52,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:16:52,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281964196] [2024-11-08 23:16:52,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:16:52,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:16:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:16:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:16:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:16:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:16:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:16:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:16:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:16:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:16:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 23:16:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:16:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:16:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:16:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:16:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:16:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:16:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:16:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:16:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:16:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:16:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:16:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:16:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:16:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 23:16:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 23:16:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 23:16:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 23:16:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 23:16:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 23:16:52,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:16:52,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281964196] [2024-11-08 23:16:52,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281964196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:16:52,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:16:52,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:16:52,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733513925] [2024-11-08 23:16:52,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:16:52,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:16:52,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:16:52,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:16:52,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:16:52,687 INFO L87 Difference]: Start difference. First operand 110 states and 170 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 23:16:52,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:16:52,764 INFO L93 Difference]: Finished difference Result 319 states and 494 transitions. [2024-11-08 23:16:52,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:16:52,764 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 188 [2024-11-08 23:16:52,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:16:52,767 INFO L225 Difference]: With dead ends: 319 [2024-11-08 23:16:52,767 INFO L226 Difference]: Without dead ends: 212 [2024-11-08 23:16:52,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-11-08 23:16:52,772 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 151 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:16:52,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 460 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:16:52,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-08 23:16:52,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 137. [2024-11-08 23:16:52,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 107 states have (on average 1.4485981308411215) internal successors, (155), 107 states have internal predecessors, (155), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 23:16:52,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 211 transitions. [2024-11-08 23:16:52,794 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 211 transitions. Word has length 188 [2024-11-08 23:16:52,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:16:52,795 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 211 transitions. [2024-11-08 23:16:52,796 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 23:16:52,796 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 211 transitions. [2024-11-08 23:16:52,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 23:16:52,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:16:52,802 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:16:52,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:16:52,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:16:52,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:16:52,803 INFO L85 PathProgramCache]: Analyzing trace with hash -150477538, now seen corresponding path program 1 times [2024-11-08 23:16:52,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:16:52,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751844869] [2024-11-08 23:16:52,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:16:52,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:16:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:16:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:16:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:16:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:16:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:16:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:16:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:16:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:16:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 23:16:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:16:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:16:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:16:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:16:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:16:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:16:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:16:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:16:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:16:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:16:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:16:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:52,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:16:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:16:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 23:16:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 23:16:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 23:16:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 23:16:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 23:16:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 23:16:53,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:16:53,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751844869] [2024-11-08 23:16:53,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751844869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:16:53,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:16:53,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:16:53,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442018597] [2024-11-08 23:16:53,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:16:53,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:16:53,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:16:53,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:16:53,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:16:53,021 INFO L87 Difference]: Start difference. First operand 137 states and 211 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 23:16:53,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:16:53,102 INFO L93 Difference]: Finished difference Result 405 states and 627 transitions. [2024-11-08 23:16:53,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:16:53,102 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 188 [2024-11-08 23:16:53,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:16:53,106 INFO L225 Difference]: With dead ends: 405 [2024-11-08 23:16:53,106 INFO L226 Difference]: Without dead ends: 271 [2024-11-08 23:16:53,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 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-11-08 23:16:53,111 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 145 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:16:53,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 376 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:16:53,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-08 23:16:53,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 208. [2024-11-08 23:16:53,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 178 states have (on average 1.4943820224719102) internal successors, (266), 178 states have internal predecessors, (266), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 23:16:53,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 322 transitions. [2024-11-08 23:16:53,132 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 322 transitions. Word has length 188 [2024-11-08 23:16:53,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:16:53,133 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 322 transitions. [2024-11-08 23:16:53,133 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 23:16:53,133 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 322 transitions. [2024-11-08 23:16:53,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-08 23:16:53,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:16:53,138 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:16:53,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:16:53,139 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:16:53,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:16:53,139 INFO L85 PathProgramCache]: Analyzing trace with hash -428770330, now seen corresponding path program 1 times [2024-11-08 23:16:53,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:16:53,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411749273] [2024-11-08 23:16:53,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:16:53,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:16:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:16:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:16:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:16:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:16:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:16:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:16:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:16:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:16:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 23:16:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:16:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:16:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:16:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:16:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:16:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:16:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:16:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:16:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:16:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:16:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:16:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:16:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:16:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 23:16:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 23:16:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 23:16:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 23:16:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 23:16:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 23:16:53,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:16:53,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411749273] [2024-11-08 23:16:53,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411749273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:16:53,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:16:53,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:16:53,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396193712] [2024-11-08 23:16:53,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:16:53,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:16:53,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:16:53,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:16:53,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:16:53,425 INFO L87 Difference]: Start difference. First operand 208 states and 322 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 23:16:53,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:16:53,539 INFO L93 Difference]: Finished difference Result 561 states and 867 transitions. [2024-11-08 23:16:53,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:16:53,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2024-11-08 23:16:53,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:16:53,544 INFO L225 Difference]: With dead ends: 561 [2024-11-08 23:16:53,544 INFO L226 Difference]: Without dead ends: 356 [2024-11-08 23:16:53,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:16:53,545 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 97 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:16:53,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 415 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:16:53,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-08 23:16:53,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 319. [2024-11-08 23:16:53,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 289 states have (on average 1.5155709342560553) internal successors, (438), 289 states have internal predecessors, (438), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 23:16:53,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 494 transitions. [2024-11-08 23:16:53,564 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 494 transitions. Word has length 189 [2024-11-08 23:16:53,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:16:53,564 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 494 transitions. [2024-11-08 23:16:53,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 23:16:53,565 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 494 transitions. [2024-11-08 23:16:53,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-08 23:16:53,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:16:53,570 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:16:53,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:16:53,570 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:16:53,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:16:53,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1597597909, now seen corresponding path program 1 times [2024-11-08 23:16:53,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:16:53,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450132133] [2024-11-08 23:16:53,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:16:53,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:16:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:16:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:16:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:16:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:16:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:16:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:16:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:16:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:16:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 23:16:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:16:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:16:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:16:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:16:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:16:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:16:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:16:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:16:53,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:16:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:16:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:16:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:16:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:16:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 23:16:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 23:16:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 23:16:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 23:16:53,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 23:16:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 23:16:53,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:16:53,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450132133] [2024-11-08 23:16:53,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450132133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:16:53,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:16:53,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:16:53,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042934700] [2024-11-08 23:16:53,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:16:53,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:16:53,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:16:53,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:16:53,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:16:53,700 INFO L87 Difference]: Start difference. First operand 319 states and 494 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 23:16:53,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:16:53,768 INFO L93 Difference]: Finished difference Result 825 states and 1282 transitions. [2024-11-08 23:16:53,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:16:53,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2024-11-08 23:16:53,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:16:53,771 INFO L225 Difference]: With dead ends: 825 [2024-11-08 23:16:53,772 INFO L226 Difference]: Without dead ends: 509 [2024-11-08 23:16:53,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-11-08 23:16:53,773 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 145 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:16:53,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 458 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:16:53,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-11-08 23:16:53,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 319. [2024-11-08 23:16:53,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 289 states have (on average 1.5155709342560553) internal successors, (438), 289 states have internal predecessors, (438), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 23:16:53,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 494 transitions. [2024-11-08 23:16:53,787 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 494 transitions. Word has length 189 [2024-11-08 23:16:53,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:16:53,787 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 494 transitions. [2024-11-08 23:16:53,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 23:16:53,787 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 494 transitions. [2024-11-08 23:16:53,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-08 23:16:53,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:16:53,789 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:16:53,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:16:53,789 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:16:53,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:16:53,790 INFO L85 PathProgramCache]: Analyzing trace with hash 325630125, now seen corresponding path program 1 times [2024-11-08 23:16:53,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:16:53,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222692348] [2024-11-08 23:16:53,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:16:53,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:16:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:16:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:16:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:16:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:16:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:16:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:16:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:16:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:16:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 23:16:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:16:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:16:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:16:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:16:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:16:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:16:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:16:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:16:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:16:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:16:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:16:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:16:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:16:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 23:16:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:53,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 23:16:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 23:16:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 23:16:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 23:16:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 23:16:54,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:16:54,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222692348] [2024-11-08 23:16:54,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222692348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:16:54,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:16:54,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:16:54,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947646128] [2024-11-08 23:16:54,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:16:54,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:16:54,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:16:54,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:16:54,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:16:54,009 INFO L87 Difference]: Start difference. First operand 319 states and 494 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 23:16:54,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:16:54,099 INFO L93 Difference]: Finished difference Result 704 states and 1091 transitions. [2024-11-08 23:16:54,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:16:54,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2024-11-08 23:16:54,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:16:54,102 INFO L225 Difference]: With dead ends: 704 [2024-11-08 23:16:54,102 INFO L226 Difference]: Without dead ends: 388 [2024-11-08 23:16:54,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:16:54,103 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 47 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:16:54,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 299 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:16:54,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-08 23:16:54,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 325. [2024-11-08 23:16:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 295 states have (on average 1.511864406779661) internal successors, (446), 295 states have internal predecessors, (446), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 23:16:54,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 502 transitions. [2024-11-08 23:16:54,110 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 502 transitions. Word has length 189 [2024-11-08 23:16:54,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:16:54,111 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 502 transitions. [2024-11-08 23:16:54,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 23:16:54,111 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 502 transitions. [2024-11-08 23:16:54,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 23:16:54,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:16:54,113 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:16:54,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 23:16:54,113 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:16:54,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:16:54,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1448479815, now seen corresponding path program 1 times [2024-11-08 23:16:54,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:16:54,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595959111] [2024-11-08 23:16:54,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:16:54,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:16:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:16:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:16:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:16:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:16:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:16:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:16:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:16:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:16:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 23:16:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:16:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:16:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:16:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:16:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:16:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:16:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:16:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:16:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:16:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:16:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:16:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:16:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:16:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 23:16:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 23:16:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 23:16:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 23:16:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 23:16:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:16:54,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 23:16:54,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:16:54,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595959111] [2024-11-08 23:16:54,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595959111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:16:54,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:16:54,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:16:54,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400480599] [2024-11-08 23:16:54,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:16:54,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:16:54,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:16:54,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:16:54,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:16:54,344 INFO L87 Difference]: Start difference. First operand 325 states and 502 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 23:16:54,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:16:54,709 INFO L93 Difference]: Finished difference Result 969 states and 1479 transitions. [2024-11-08 23:16:54,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:16:54,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 190 [2024-11-08 23:16:54,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:16:54,713 INFO L225 Difference]: With dead ends: 969 [2024-11-08 23:16:54,713 INFO L226 Difference]: Without dead ends: 647 [2024-11-08 23:16:54,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:16:54,714 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 277 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:16:54,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 673 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:16:54,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-11-08 23:16:54,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 458. [2024-11-08 23:16:54,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 428 states have (on average 1.514018691588785) internal successors, (648), 428 states have internal predecessors, (648), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 23:16:54,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 704 transitions. [2024-11-08 23:16:54,726 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 704 transitions. Word has length 190 [2024-11-08 23:16:54,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:16:54,728 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 704 transitions. [2024-11-08 23:16:54,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 23:16:54,728 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 704 transitions. [2024-11-08 23:16:54,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 23:16:54,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:16:54,734 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:16:54,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 23:16:54,734 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:16:54,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:16:54,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1690557853, now seen corresponding path program 1 times [2024-11-08 23:16:54,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:16:54,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154221072] [2024-11-08 23:16:54,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:16:54,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:16:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:16:54,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1110825212] [2024-11-08 23:16:54,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:16:54,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:16:54,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:16:54,820 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:16:54,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:16:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:16:54,957 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:16:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:16:55,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:16:55,086 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:16:55,087 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:16:55,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 23:16:55,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:16:55,292 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:16:55,384 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:16:55,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:16:55 BoogieIcfgContainer [2024-11-08 23:16:55,386 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:16:55,387 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:16:55,387 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:16:55,387 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:16:55,387 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:16:51" (3/4) ... [2024-11-08 23:16:55,389 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:16:55,390 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:16:55,390 INFO L158 Benchmark]: Toolchain (without parser) took 4638.78ms. Allocated memory was 172.0MB in the beginning and 276.8MB in the end (delta: 104.9MB). Free memory was 97.8MB in the beginning and 101.2MB in the end (delta: -3.4MB). Peak memory consumption was 101.8MB. Max. memory is 16.1GB. [2024-11-08 23:16:55,390 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 172.0MB. Free memory was 127.4MB in the beginning and 127.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:16:55,391 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.56ms. Allocated memory is still 172.0MB. Free memory was 97.6MB in the beginning and 137.5MB in the end (delta: -39.9MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2024-11-08 23:16:55,391 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.95ms. Allocated memory is still 172.0MB. Free memory was 137.5MB in the beginning and 132.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:16:55,391 INFO L158 Benchmark]: Boogie Preprocessor took 59.85ms. Allocated memory is still 172.0MB. Free memory was 132.3MB in the beginning and 126.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:16:55,391 INFO L158 Benchmark]: RCFGBuilder took 549.12ms. Allocated memory is still 172.0MB. Free memory was 126.0MB in the beginning and 92.2MB in the end (delta: 33.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-08 23:16:55,391 INFO L158 Benchmark]: TraceAbstraction took 3631.71ms. Allocated memory was 172.0MB in the beginning and 276.8MB in the end (delta: 104.9MB). Free memory was 91.4MB in the beginning and 101.2MB in the end (delta: -9.9MB). Peak memory consumption was 95.0MB. Max. memory is 16.1GB. [2024-11-08 23:16:55,392 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 276.8MB. Free memory is still 101.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:16:55,393 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.18ms. Allocated memory is still 172.0MB. Free memory was 127.4MB in the beginning and 127.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.56ms. Allocated memory is still 172.0MB. Free memory was 97.6MB in the beginning and 137.5MB in the end (delta: -39.9MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.95ms. Allocated memory is still 172.0MB. Free memory was 137.5MB in the beginning and 132.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.85ms. Allocated memory is still 172.0MB. Free memory was 132.3MB in the beginning and 126.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 549.12ms. Allocated memory is still 172.0MB. Free memory was 126.0MB in the beginning and 92.2MB in the end (delta: 33.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3631.71ms. Allocated memory was 172.0MB in the beginning and 276.8MB in the end (delta: 104.9MB). Free memory was 91.4MB in the beginning and 101.2MB in the end (delta: -9.9MB). Peak memory consumption was 95.0MB. Max. memory is 16.1GB. * Witness Printer took 3.23ms. Allocated memory is still 276.8MB. Free memory is still 101.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 193, overapproximation of someBinaryFLOATComparisonOperation at line 193. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 32; [L23] unsigned char var_1_3 = 32; [L24] unsigned char var_1_4 = 4; [L25] double var_1_5 = 128.5; [L26] signed long int var_1_6 = 64; [L27] signed long int var_1_7 = 4; [L28] double var_1_8 = 1.875; [L29] double var_1_9 = 0.1; [L30] double var_1_10 = 32.6; [L31] double var_1_11 = 0.6; [L32] signed long int var_1_12 = -128; [L33] signed long int var_1_14 = 16; [L34] signed short int var_1_15 = 1; [L35] signed long int var_1_18 = 2; [L36] signed char var_1_19 = 32; [L37] signed char var_1_20 = 50; [L38] signed short int var_1_21 = 16; [L39] unsigned char var_1_22 = 0; [L40] signed long int var_1_23 = 25; [L41] unsigned short int var_1_24 = 50906; [L42] unsigned short int var_1_25 = 21992; [L43] float var_1_26 = 3.25; [L44] float var_1_27 = 10.2; [L45] float var_1_28 = 16.5; [L46] float var_1_29 = 0.0; [L47] float var_1_30 = 99.8; [L48] signed char var_1_31 = 2; [L49] float var_1_33 = 4.2; [L50] unsigned char last_1_var_1_1 = 32; [L51] unsigned char last_1_var_1_22 = 0; [L52] signed long int last_1_var_1_23 = 25; VAL [isInitial=0, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=32, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L197] isInitial = 1 [L198] FCALL initially() [L199] int k_loop; [L200] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=32, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L200] COND TRUE k_loop < 1 [L201] CALL updateLastVariables() [L188] last_1_var_1_1 = var_1_1 [L189] last_1_var_1_22 = var_1_22 [L190] last_1_var_1_23 = var_1_23 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=32, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L201] RET updateLastVariables() [L202] CALL updateVariables() [L142] var_1_3 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L143] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L144] CALL assume_abort_if_not(var_1_3 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L144] RET assume_abort_if_not(var_1_3 <= 64) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L145] var_1_4 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L146] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L147] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L147] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L148] var_1_6 = __VERIFIER_nondet_long() [L149] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L149] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L150] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L150] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L151] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L151] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L152] var_1_7 = __VERIFIER_nondet_long() [L153] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L153] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L154] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L154] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L155] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L155] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L156] var_1_8 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3, var_1_9=1/10] [L157] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3, var_1_9=1/10] [L158] var_1_9 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L159] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L160] var_1_10 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L161] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L162] var_1_11 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L163] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L164] var_1_18 = __VERIFIER_nondet_long() [L165] CALL assume_abort_if_not(var_1_18 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L165] RET assume_abort_if_not(var_1_18 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L166] CALL assume_abort_if_not(var_1_18 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L166] RET assume_abort_if_not(var_1_18 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L167] CALL assume_abort_if_not(var_1_18 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L167] RET assume_abort_if_not(var_1_18 != 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L168] var_1_20 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_20 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L169] RET assume_abort_if_not(var_1_20 >= -63) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L170] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L170] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L171] var_1_24 = __VERIFIER_nondet_ushort() [L172] CALL assume_abort_if_not(var_1_24 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L172] RET assume_abort_if_not(var_1_24 >= 32767) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L173] CALL assume_abort_if_not(var_1_24 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L173] RET assume_abort_if_not(var_1_24 <= 65535) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L174] var_1_25 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_25 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L175] RET assume_abort_if_not(var_1_25 >= 16383) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L176] CALL assume_abort_if_not(var_1_25 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L176] RET assume_abort_if_not(var_1_25 <= 32767) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L177] var_1_27 = __VERIFIER_nondet_float() [L178] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L178] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L179] var_1_28 = __VERIFIER_nondet_float() [L180] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L180] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L181] var_1_29 = __VERIFIER_nondet_float() [L182] CALL assume_abort_if_not((var_1_29 >= 4611686.018427382800e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L182] RET assume_abort_if_not((var_1_29 >= 4611686.018427382800e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L183] var_1_31 = __VERIFIER_nondet_char() [L184] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L184] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L185] CALL assume_abort_if_not(var_1_31 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L185] RET assume_abort_if_not(var_1_31 <= 127) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L202] RET updateVariables() [L203] CALL step() [L56] COND FALSE !(last_1_var_1_22 || last_1_var_1_22) [L63] var_1_15 = 2 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=2, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L65] var_1_22 = 0 [L66] var_1_33 = var_1_10 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=-128, var_1_14=16, var_1_15=2, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L67] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=-128, var_1_14=16, var_1_15=2, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L70] unsigned char stepLocal_1 = var_1_22; VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_1=0, var_1_10=2, var_1_12=-128, var_1_14=16, var_1_15=2, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L71] COND TRUE stepLocal_1 || (var_1_4 <= (- var_1_6)) [L72] var_1_14 = ((((((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) > (var_1_15)) ? (((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_15))) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L76] signed long int stepLocal_0 = (var_1_3 / 1) / var_1_6; VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-6, var_1_7=3] [L77] COND FALSE !(\read(var_1_22)) [L84] var_1_5 = var_1_10 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-6, var_1_7=3] [L86] signed long int stepLocal_4 = (((var_1_15) > (var_1_7)) ? (var_1_15) : (var_1_7)); VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_4=3, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-6, var_1_7=3] [L87] COND FALSE !((var_1_24 - (var_1_25 - var_1_3)) <= stepLocal_4) [L94] var_1_23 = var_1_1 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-6, var_1_7=3] [L96] var_1_12 = ((((((var_1_23) < (var_1_3)) ? (var_1_23) : (var_1_3))) + var_1_4) + ((((var_1_1) < (100)) ? (var_1_1) : (100)))) [L97] signed long int stepLocal_7 = -1; [L98] signed long int stepLocal_6 = 0 & var_1_25; [L99] signed short int stepLocal_5 = var_1_15; VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_5=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-6, var_1_7=3] [L100] COND FALSE !(stepLocal_5 < var_1_15) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=6, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-6, var_1_7=3] [L109] COND TRUE var_1_9 > (var_1_26 * var_1_8) [L110] var_1_19 = var_1_4 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=6, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-6, var_1_7=3] [L114] signed short int stepLocal_3 = var_1_15; VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_3=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=6, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-6, var_1_7=3] [L115] EXPR 5 | var_1_3 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_3=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=6, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-6, var_1_7=3] [L115] EXPR var_1_4 << var_1_18 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_3=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=6, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-6, var_1_7=3] [L115] unsigned char stepLocal_2 = (5 | var_1_3) < (var_1_4 << var_1_18); [L116] COND FALSE !(stepLocal_2 && (var_1_19 < var_1_23)) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_3=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=6, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-6, var_1_7=3] [L119] COND TRUE var_1_18 > stepLocal_3 [L120] var_1_21 = var_1_20 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=6, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-6, var_1_7=3] [L125] EXPR var_1_15 ^ var_1_21 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=6, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-6, var_1_7=3] [L125] COND FALSE !((var_1_15 ^ var_1_21) <= var_1_21) [L203] RET step() [L204] CALL, EXPR property() [L193] EXPR ((((((var_1_22 ? (var_1_1 == ((unsigned char) ((var_1_3 + var_1_4) + 8))) : 1) && (var_1_22 ? ((((var_1_3 / 1) / var_1_6) == ((var_1_14 * var_1_4) % var_1_7)) ? (var_1_5 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_5 == ((double) var_1_11))) : (var_1_5 == ((double) var_1_10)))) && (var_1_12 == ((signed long int) ((((((var_1_23) < (var_1_3)) ? (var_1_23) : (var_1_3))) + var_1_4) + ((((var_1_1) < (100)) ? (var_1_1) : (100))))))) && ((var_1_22 || (var_1_4 <= (- var_1_6))) ? (var_1_14 == ((signed long int) ((((((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) > (var_1_15)) ? (((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_15))))) : (var_1_14 == ((signed long int) 5)))) && ((last_1_var_1_22 || last_1_var_1_22) ? (((last_1_var_1_1 * (last_1_var_1_23 % var_1_7)) < (var_1_6 / var_1_18)) ? (var_1_15 == ((signed short int) 10)) : (var_1_15 == ((signed short int) var_1_4))) : (var_1_15 == ((signed short int) 2)))) && ((var_1_9 > (var_1_26 * var_1_8)) ? (var_1_19 == ((signed char) var_1_4)) : (var_1_19 == ((signed char) (var_1_4 + var_1_20))))) && ((((5 | var_1_3) < (var_1_4 << var_1_18)) && (var_1_19 < var_1_23)) ? (var_1_21 == ((signed short int) var_1_3)) : ((var_1_18 > var_1_15) ? (var_1_21 == ((signed short int) var_1_20)) : (var_1_21 == ((signed short int) var_1_4)))) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=6, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-6, var_1_7=3] [L193] EXPR ((((((((((var_1_22 ? (var_1_1 == ((unsigned char) ((var_1_3 + var_1_4) + 8))) : 1) && (var_1_22 ? ((((var_1_3 / 1) / var_1_6) == ((var_1_14 * var_1_4) % var_1_7)) ? (var_1_5 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_5 == ((double) var_1_11))) : (var_1_5 == ((double) var_1_10)))) && (var_1_12 == ((signed long int) ((((((var_1_23) < (var_1_3)) ? (var_1_23) : (var_1_3))) + var_1_4) + ((((var_1_1) < (100)) ? (var_1_1) : (100))))))) && ((var_1_22 || (var_1_4 <= (- var_1_6))) ? (var_1_14 == ((signed long int) ((((((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) > (var_1_15)) ? (((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_15))))) : (var_1_14 == ((signed long int) 5)))) && ((last_1_var_1_22 || last_1_var_1_22) ? (((last_1_var_1_1 * (last_1_var_1_23 % var_1_7)) < (var_1_6 / var_1_18)) ? (var_1_15 == ((signed short int) 10)) : (var_1_15 == ((signed short int) var_1_4))) : (var_1_15 == ((signed short int) 2)))) && ((var_1_9 > (var_1_26 * var_1_8)) ? (var_1_19 == ((signed char) var_1_4)) : (var_1_19 == ((signed char) (var_1_4 + var_1_20))))) && ((((5 | var_1_3) < (var_1_4 << var_1_18)) && (var_1_19 < var_1_23)) ? (var_1_21 == ((signed short int) var_1_3)) : ((var_1_18 > var_1_15) ? (var_1_21 == ((signed short int) var_1_20)) : (var_1_21 == ((signed short int) var_1_4))))) && (var_1_22 == ((unsigned char) 0))) && (((var_1_24 - (var_1_25 - var_1_3)) <= ((((var_1_15) > (var_1_7)) ? (var_1_15) : (var_1_7)))) ? (var_1_22 ? (var_1_23 == ((signed long int) (var_1_24 - var_1_25))) : (var_1_23 == ((signed long int) 50))) : (var_1_23 == ((signed long int) var_1_1)))) && ((var_1_15 < var_1_15) ? ((-1 >= var_1_23) ? ((var_1_23 <= (0 & var_1_25)) ? (var_1_26 == ((float) (var_1_9 - (var_1_27 + var_1_28)))) : 1) : (var_1_26 == ((float) (((((var_1_9) > ((var_1_29 - var_1_28))) ? (var_1_9) : ((var_1_29 - var_1_28)))) - var_1_27)))) : 1)) && (((var_1_15 ^ var_1_21) <= var_1_21) ? ((var_1_22 && var_1_22) ? (var_1_22 ? (var_1_30 == ((float) ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))))) : 1) : ((((var_1_3 + var_1_4) - var_1_31) <= var_1_21) ? ((var_1_20 < var_1_1) ? (var_1_30 == ((float) (var_1_9 - var_1_27))) : (var_1_30 == ((float) ((((var_1_10) > (var_1_8)) ? (var_1_10) : (var_1_8)))))) : 1)) : 1) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=6, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-6, var_1_7=3] [L193-L194] return (((((((((((var_1_22 ? (var_1_1 == ((unsigned char) ((var_1_3 + var_1_4) + 8))) : 1) && (var_1_22 ? ((((var_1_3 / 1) / var_1_6) == ((var_1_14 * var_1_4) % var_1_7)) ? (var_1_5 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_5 == ((double) var_1_11))) : (var_1_5 == ((double) var_1_10)))) && (var_1_12 == ((signed long int) ((((((var_1_23) < (var_1_3)) ? (var_1_23) : (var_1_3))) + var_1_4) + ((((var_1_1) < (100)) ? (var_1_1) : (100))))))) && ((var_1_22 || (var_1_4 <= (- var_1_6))) ? (var_1_14 == ((signed long int) ((((((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) > (var_1_15)) ? (((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_15))))) : (var_1_14 == ((signed long int) 5)))) && ((last_1_var_1_22 || last_1_var_1_22) ? (((last_1_var_1_1 * (last_1_var_1_23 % var_1_7)) < (var_1_6 / var_1_18)) ? (var_1_15 == ((signed short int) 10)) : (var_1_15 == ((signed short int) var_1_4))) : (var_1_15 == ((signed short int) 2)))) && ((var_1_9 > (var_1_26 * var_1_8)) ? (var_1_19 == ((signed char) var_1_4)) : (var_1_19 == ((signed char) (var_1_4 + var_1_20))))) && ((((5 | var_1_3) < (var_1_4 << var_1_18)) && (var_1_19 < var_1_23)) ? (var_1_21 == ((signed short int) var_1_3)) : ((var_1_18 > var_1_15) ? (var_1_21 == ((signed short int) var_1_20)) : (var_1_21 == ((signed short int) var_1_4))))) && (var_1_22 == ((unsigned char) 0))) && (((var_1_24 - (var_1_25 - var_1_3)) <= ((((var_1_15) > (var_1_7)) ? (var_1_15) : (var_1_7)))) ? (var_1_22 ? (var_1_23 == ((signed long int) (var_1_24 - var_1_25))) : (var_1_23 == ((signed long int) 50))) : (var_1_23 == ((signed long int) var_1_1)))) && ((var_1_15 < var_1_15) ? ((-1 >= var_1_23) ? ((var_1_23 <= (0 & var_1_25)) ? (var_1_26 == ((float) (var_1_9 - (var_1_27 + var_1_28)))) : 1) : (var_1_26 == ((float) (((((var_1_9) > ((var_1_29 - var_1_28))) ? (var_1_9) : ((var_1_29 - var_1_28)))) - var_1_27)))) : 1)) && (((var_1_15 ^ var_1_21) <= var_1_21) ? ((var_1_22 && var_1_22) ? (var_1_22 ? (var_1_30 == ((float) ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))))) : 1) : ((((var_1_3 + var_1_4) - var_1_31) <= var_1_21) ? ((var_1_20 < var_1_1) ? (var_1_30 == ((float) (var_1_9 - var_1_27))) : (var_1_30 == ((float) ((((var_1_10) > (var_1_8)) ? (var_1_10) : (var_1_8)))))) : 1)) : 1)) && (var_1_33 == ((float) var_1_10)) ; [L204] RET, EXPR property() [L204] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=6, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-6, var_1_7=3] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=6, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-6, var_1_7=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 8, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 862 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 862 mSDsluCounter, 2855 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1311 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 638 IncrementalHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 1544 mSDtfsCounter, 638 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 451 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=458occurred in iteration=7, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 617 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1701 NumberOfCodeBlocks, 1701 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1314 ConstructedInterpolants, 0 QuantifiedInterpolants, 1614 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 10584/10584 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-11-08 23:16:55,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-15.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ffd456b3aee4a03e3ad29674b9135df7e42dac45ab32681ea39048340b5ac3f8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:16:57,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:16:57,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:16:57,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:16:57,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:16:57,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:16:57,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:16:57,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:16:57,249 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:16:57,250 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:16:57,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:16:57,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:16:57,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:16:57,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:16:57,252 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:16:57,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:16:57,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:16:57,253 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:16:57,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:16:57,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:16:57,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:16:57,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:16:57,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:16:57,257 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:16:57,257 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:16:57,257 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:16:57,258 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:16:57,258 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:16:57,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:16:57,258 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:16:57,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:16:57,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:16:57,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:16:57,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:16:57,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:16:57,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:16:57,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:16:57,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:16:57,270 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:16:57,270 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:16:57,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:16:57,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:16:57,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:16:57,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:16:57,271 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ffd456b3aee4a03e3ad29674b9135df7e42dac45ab32681ea39048340b5ac3f8 [2024-11-08 23:16:57,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:16:57,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:16:57,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:16:57,528 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:16:57,529 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:16:57,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-15.i [2024-11-08 23:16:58,829 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:16:58,983 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:16:58,983 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-15.i [2024-11-08 23:16:58,992 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70106f707/1972bfc7da09465d909398c4cceaf1a3/FLAG0a18fa451 [2024-11-08 23:16:59,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70106f707/1972bfc7da09465d909398c4cceaf1a3 [2024-11-08 23:16:59,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:16:59,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:16:59,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:16:59,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:16:59,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:16:59,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:16:59" (1/1) ... [2024-11-08 23:16:59,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bba4ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:59, skipping insertion in model container [2024-11-08 23:16:59,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:16:59" (1/1) ... [2024-11-08 23:16:59,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:16:59,563 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-15.i[916,929] [2024-11-08 23:16:59,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:16:59,650 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:16:59,663 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-15.i[916,929] [2024-11-08 23:16:59,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:16:59,722 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:16:59,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:59 WrapperNode [2024-11-08 23:16:59,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:16:59,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:16:59,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:16:59,724 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:16:59,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:59" (1/1) ... [2024-11-08 23:16:59,748 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:59" (1/1) ... [2024-11-08 23:16:59,776 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-11-08 23:16:59,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:16:59,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:16:59,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:16:59,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:16:59,785 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:59" (1/1) ... [2024-11-08 23:16:59,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:59" (1/1) ... [2024-11-08 23:16:59,793 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:59" (1/1) ... [2024-11-08 23:16:59,814 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-11-08 23:16:59,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:59" (1/1) ... [2024-11-08 23:16:59,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:59" (1/1) ... [2024-11-08 23:16:59,821 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:59" (1/1) ... [2024-11-08 23:16:59,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:59" (1/1) ... [2024-11-08 23:16:59,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:59" (1/1) ... [2024-11-08 23:16:59,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:59" (1/1) ... [2024-11-08 23:16:59,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:16:59,830 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:16:59,830 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:16:59,830 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:16:59,831 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:59" (1/1) ... [2024-11-08 23:16:59,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:16:59,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:16:59,858 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:16:59,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:16:59,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:16:59,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:16:59,889 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:16:59,889 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:16:59,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:16:59,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:16:59,958 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:16:59,959 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:17:12,961 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-08 23:17:12,961 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:17:12,974 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:17:12,974 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:17:12,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:17:12 BoogieIcfgContainer [2024-11-08 23:17:12,975 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:17:12,977 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:17:12,977 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:17:12,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:17:12,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:16:59" (1/3) ... [2024-11-08 23:17:12,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a82f03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:17:12, skipping insertion in model container [2024-11-08 23:17:12,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:16:59" (2/3) ... [2024-11-08 23:17:12,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a82f03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:17:12, skipping insertion in model container [2024-11-08 23:17:12,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:17:12" (3/3) ... [2024-11-08 23:17:12,981 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-15.i [2024-11-08 23:17:12,993 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:17:12,993 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:17:13,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:17:13,045 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;@43f4c5e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:17:13,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:17:13,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 23:17:13,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-08 23:17:13,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:17:13,063 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:17:13,064 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:17:13,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:17:13,069 INFO L85 PathProgramCache]: Analyzing trace with hash -135195189, now seen corresponding path program 1 times [2024-11-08 23:17:13,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:17:13,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493552421] [2024-11-08 23:17:13,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:17:13,082 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-11-08 23:17:13,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:17:13,086 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:17:13,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:17:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:13,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:17:13,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:17:13,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 702 proven. 0 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2024-11-08 23:17:13,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:17:13,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:17:13,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493552421] [2024-11-08 23:17:13,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493552421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:17:13,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:17:13,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:17:13,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118936912] [2024-11-08 23:17:13,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:17:13,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:17:13,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:17:13,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:17:13,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:17:13,808 INFO L87 Difference]: Start difference. First operand has 89 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 23:17:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:17:13,840 INFO L93 Difference]: Finished difference Result 175 states and 301 transitions. [2024-11-08 23:17:13,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:17:13,843 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 180 [2024-11-08 23:17:13,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:17:13,848 INFO L225 Difference]: With dead ends: 175 [2024-11-08 23:17:13,849 INFO L226 Difference]: Without dead ends: 85 [2024-11-08 23:17:13,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 179 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-11-08 23:17:13,857 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:17:13,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:17:13,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-08 23:17:13,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-08 23:17:13,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 23:17:13,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 131 transitions. [2024-11-08 23:17:13,896 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 131 transitions. Word has length 180 [2024-11-08 23:17:13,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:17:13,897 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 131 transitions. [2024-11-08 23:17:13,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 23:17:13,897 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 131 transitions. [2024-11-08 23:17:13,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-08 23:17:13,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:17:13,899 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:17:13,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 23:17:14,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:17:14,100 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:17:14,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:17:14,101 INFO L85 PathProgramCache]: Analyzing trace with hash 219173715, now seen corresponding path program 1 times [2024-11-08 23:17:14,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:17:14,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214751972] [2024-11-08 23:17:14,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:17:14,102 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-11-08 23:17:14,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:17:14,103 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:17:14,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 23:17:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:14,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 23:17:14,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:17:14,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 23:17:14,839 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:17:14,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:17:14,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214751972] [2024-11-08 23:17:14,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [214751972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:17:14,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:17:14,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:17:14,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873823019] [2024-11-08 23:17:14,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:17:14,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:17:14,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:17:14,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:17:14,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:17:14,842 INFO L87 Difference]: Start difference. First operand 85 states and 131 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 23:17:19,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:17:23,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:17:23,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:17:23,772 INFO L93 Difference]: Finished difference Result 244 states and 377 transitions. [2024-11-08 23:17:23,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:17:23,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 180 [2024-11-08 23:17:23,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:17:23,783 INFO L225 Difference]: With dead ends: 244 [2024-11-08 23:17:23,784 INFO L226 Difference]: Without dead ends: 162 [2024-11-08 23:17:23,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 178 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-11-08 23:17:23,785 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 112 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-08 23:17:23,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 347 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2024-11-08 23:17:23,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-08 23:17:23,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 102. [2024-11-08 23:17:23,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 72 states have internal predecessors, (100), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 23:17:23,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 156 transitions. [2024-11-08 23:17:23,805 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 156 transitions. Word has length 180 [2024-11-08 23:17:23,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:17:23,806 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 156 transitions. [2024-11-08 23:17:23,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 23:17:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 156 transitions. [2024-11-08 23:17:23,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-08 23:17:23,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:17:23,812 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:17:23,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 23:17:24,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:17:24,013 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:17:24,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:17:24,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1369174187, now seen corresponding path program 1 times [2024-11-08 23:17:24,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:17:24,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392320390] [2024-11-08 23:17:24,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:17:24,015 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-11-08 23:17:24,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:17:24,017 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:17:24,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 23:17:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:17:24,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 23:17:24,678 INFO L278 TraceCheckSpWp]: Computing forward predicates...