./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.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 f0e464b03528fd07ed2a214c41d5d0c75fd807ee4909056da113988031a11e66 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:11:29,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:11:29,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 06:11:29,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:11:29,732 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:11:29,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:11:29,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:11:29,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:11:29,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:11:29,763 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:11:29,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:11:29,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:11:29,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:11:29,765 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:11:29,766 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:11:29,767 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:11:29,767 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:11:29,767 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:11:29,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 06:11:29,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:11:29,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:11:29,771 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:11:29,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:11:29,772 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:11:29,772 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:11:29,773 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:11:29,773 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:11:29,773 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:11:29,773 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:11:29,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:11:29,774 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:11:29,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:11:29,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:11:29,775 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:11:29,775 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:11:29,775 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:11:29,776 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 06:11:29,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 06:11:29,776 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:11:29,776 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:11:29,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:11:29,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:11:29,778 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 -> f0e464b03528fd07ed2a214c41d5d0c75fd807ee4909056da113988031a11e66 [2024-10-24 06:11:30,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:11:30,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:11:30,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:11:30,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:11:30,091 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:11:30,092 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2024-10-24 06:11:31,563 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:11:31,784 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:11:31,785 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2024-10-24 06:11:31,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44db69c33/383d01c62dc34a5d8db8c45340dd5199/FLAGec3559894 [2024-10-24 06:11:31,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44db69c33/383d01c62dc34a5d8db8c45340dd5199 [2024-10-24 06:11:31,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:11:31,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:11:31,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:11:31,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:11:31,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:11:31,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:11:31" (1/1) ... [2024-10-24 06:11:31,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19eccdb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:31, skipping insertion in model container [2024-10-24 06:11:31,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:11:31" (1/1) ... [2024-10-24 06:11:31,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:11:32,038 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i[915,928] [2024-10-24 06:11:32,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:11:32,154 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:11:32,169 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i[915,928] [2024-10-24 06:11:32,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:11:32,242 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:11:32,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:32 WrapperNode [2024-10-24 06:11:32,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:11:32,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:11:32,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:11:32,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:11:32,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:32" (1/1) ... [2024-10-24 06:11:32,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:32" (1/1) ... [2024-10-24 06:11:32,330 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 257 [2024-10-24 06:11:32,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:11:32,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:11:32,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:11:32,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:11:32,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:32" (1/1) ... [2024-10-24 06:11:32,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:32" (1/1) ... [2024-10-24 06:11:32,351 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:32" (1/1) ... [2024-10-24 06:11:32,389 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 06:11:32,389 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:32" (1/1) ... [2024-10-24 06:11:32,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:32" (1/1) ... [2024-10-24 06:11:32,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:32" (1/1) ... [2024-10-24 06:11:32,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:32" (1/1) ... [2024-10-24 06:11:32,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:32" (1/1) ... [2024-10-24 06:11:32,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:32" (1/1) ... [2024-10-24 06:11:32,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:11:32,424 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:11:32,424 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:11:32,424 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:11:32,425 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:32" (1/1) ... [2024-10-24 06:11:32,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:11:32,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:11:32,493 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:11:32,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:11:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:11:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:11:32,546 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:11:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 06:11:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:11:32,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:11:32,647 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:11:32,651 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:11:33,168 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-24 06:11:33,169 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:11:33,206 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:11:33,207 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:11:33,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:11:33 BoogieIcfgContainer [2024-10-24 06:11:33,207 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:11:33,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:11:33,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:11:33,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:11:33,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:11:31" (1/3) ... [2024-10-24 06:11:33,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357079f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:11:33, skipping insertion in model container [2024-10-24 06:11:33,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:32" (2/3) ... [2024-10-24 06:11:33,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357079f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:11:33, skipping insertion in model container [2024-10-24 06:11:33,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:11:33" (3/3) ... [2024-10-24 06:11:33,216 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2024-10-24 06:11:33,233 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:11:33,233 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:11:33,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:11:33,302 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;@77f7da90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:11:33,302 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:11:33,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 70 states have (on average 1.457142857142857) internal successors, (102), 71 states have internal predecessors, (102), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 06:11:33,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-24 06:11:33,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:11:33,321 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:11:33,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:11:33,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:11:33,326 INFO L85 PathProgramCache]: Analyzing trace with hash 576474020, now seen corresponding path program 1 times [2024-10-24 06:11:33,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:11:33,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438807376] [2024-10-24 06:11:33,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:33,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:11:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:11:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:11:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:11:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:11:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:11:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:11:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:11:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:11:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:11:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:11:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:11:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:11:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:11:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:11:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:11:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:11:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:11:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:11:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:11:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:11:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:11:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:11:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:11:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:11:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:11:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:11:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:11:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:11:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:11:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:33,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 06:11:33,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:11:33,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438807376] [2024-10-24 06:11:33,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438807376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:11:33,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:11:33,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:11:33,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15545114] [2024-10-24 06:11:33,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:11:33,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:11:33,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:11:34,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:11:34,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:11:34,009 INFO L87 Difference]: Start difference. First operand has 102 states, 70 states have (on average 1.457142857142857) internal successors, (102), 71 states have internal predecessors, (102), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-24 06:11:34,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:11:34,054 INFO L93 Difference]: Finished difference Result 201 states and 347 transitions. [2024-10-24 06:11:34,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:11:34,058 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 181 [2024-10-24 06:11:34,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:11:34,071 INFO L225 Difference]: With dead ends: 201 [2024-10-24 06:11:34,071 INFO L226 Difference]: Without dead ends: 100 [2024-10-24 06:11:34,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:11:34,082 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:11:34,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:11:34,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-24 06:11:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-24 06:11:34,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 69 states have internal predecessors, (97), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 06:11:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 155 transitions. [2024-10-24 06:11:34,140 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 155 transitions. Word has length 181 [2024-10-24 06:11:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:11:34,141 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 155 transitions. [2024-10-24 06:11:34,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-24 06:11:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 155 transitions. [2024-10-24 06:11:34,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-24 06:11:34,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:11:34,152 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:11:34,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 06:11:34,153 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:11:34,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:11:34,154 INFO L85 PathProgramCache]: Analyzing trace with hash 628456426, now seen corresponding path program 1 times [2024-10-24 06:11:34,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:11:34,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094080203] [2024-10-24 06:11:34,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:34,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:11:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:11:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:11:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:11:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:11:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:11:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:11:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:11:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:11:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:11:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:11:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:11:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:11:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:11:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:11:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:11:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:11:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:11:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:11:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:11:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:11:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:11:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:11:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:11:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:11:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:11:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:11:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:11:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:11:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:11:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:34,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 06:11:34,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:11:34,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094080203] [2024-10-24 06:11:34,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094080203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:11:34,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:11:34,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:11:34,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607386757] [2024-10-24 06:11:34,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:11:34,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:11:34,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:11:34,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:11:34,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:11:34,552 INFO L87 Difference]: Start difference. First operand 100 states and 155 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 06:11:34,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:11:34,671 INFO L93 Difference]: Finished difference Result 284 states and 440 transitions. [2024-10-24 06:11:34,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:11:34,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 181 [2024-10-24 06:11:34,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:11:34,676 INFO L225 Difference]: With dead ends: 284 [2024-10-24 06:11:34,680 INFO L226 Difference]: Without dead ends: 185 [2024-10-24 06:11:34,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:11:34,683 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 142 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:11:34,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 383 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:11:34,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-24 06:11:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 121. [2024-10-24 06:11:34,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 90 states have (on average 1.4) internal successors, (126), 90 states have internal predecessors, (126), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 06:11:34,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 184 transitions. [2024-10-24 06:11:34,717 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 184 transitions. Word has length 181 [2024-10-24 06:11:34,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:11:34,722 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 184 transitions. [2024-10-24 06:11:34,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 06:11:34,722 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 184 transitions. [2024-10-24 06:11:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-24 06:11:34,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:11:34,729 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:11:34,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 06:11:34,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:11:34,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:11:34,733 INFO L85 PathProgramCache]: Analyzing trace with hash -382660824, now seen corresponding path program 1 times [2024-10-24 06:11:34,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:11:34,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875540259] [2024-10-24 06:11:34,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:34,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:11:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:11:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:11:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:11:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:11:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:11:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:11:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:11:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:11:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:11:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:11:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:11:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:11:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:11:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:11:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:11:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:11:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:11:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:11:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:11:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:11:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:11:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:11:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:11:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:11:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:11:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:11:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:11:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:11:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:11:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:35,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 06:11:35,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:11:35,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875540259] [2024-10-24 06:11:35,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875540259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:11:35,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:11:35,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:11:35,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300437545] [2024-10-24 06:11:35,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:11:35,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:11:35,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:11:35,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:11:35,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:11:35,390 INFO L87 Difference]: Start difference. First operand 121 states and 184 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 06:11:35,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:11:35,814 INFO L93 Difference]: Finished difference Result 413 states and 633 transitions. [2024-10-24 06:11:35,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:11:35,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 181 [2024-10-24 06:11:35,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:11:35,822 INFO L225 Difference]: With dead ends: 413 [2024-10-24 06:11:35,822 INFO L226 Difference]: Without dead ends: 293 [2024-10-24 06:11:35,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 06:11:35,826 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 230 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 06:11:35,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 493 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 06:11:35,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-24 06:11:35,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 233. [2024-10-24 06:11:35,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 172 states have (on average 1.3837209302325582) internal successors, (238), 172 states have internal predecessors, (238), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-24 06:11:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 354 transitions. [2024-10-24 06:11:35,874 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 354 transitions. Word has length 181 [2024-10-24 06:11:35,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:11:35,876 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 354 transitions. [2024-10-24 06:11:35,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 06:11:35,877 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 354 transitions. [2024-10-24 06:11:35,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-24 06:11:35,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:11:35,882 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:11:35,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 06:11:35,882 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:11:35,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:11:35,883 INFO L85 PathProgramCache]: Analyzing trace with hash -4605167, now seen corresponding path program 1 times [2024-10-24 06:11:35,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:11:35,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423507310] [2024-10-24 06:11:35,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:35,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:11:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:11:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:11:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:11:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:11:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:11:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:11:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:11:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:11:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:11:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:11:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:11:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:11:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:11:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:11:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:11:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:11:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:11:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:11:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:11:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:11:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:11:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:11:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:11:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:11:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:11:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:11:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:11:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:11:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:11:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 06:11:36,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:11:36,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423507310] [2024-10-24 06:11:36,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423507310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:11:36,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:11:36,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 06:11:36,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263106398] [2024-10-24 06:11:36,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:11:36,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 06:11:36,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:11:36,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 06:11:36,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:11:36,619 INFO L87 Difference]: Start difference. First operand 233 states and 354 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 06:11:37,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:11:37,086 INFO L93 Difference]: Finished difference Result 610 states and 919 transitions. [2024-10-24 06:11:37,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:11:37,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 182 [2024-10-24 06:11:37,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:11:37,090 INFO L225 Difference]: With dead ends: 610 [2024-10-24 06:11:37,090 INFO L226 Difference]: Without dead ends: 378 [2024-10-24 06:11:37,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-24 06:11:37,093 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 199 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 06:11:37,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 640 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 06:11:37,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-24 06:11:37,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 355. [2024-10-24 06:11:37,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 264 states have (on average 1.3371212121212122) internal successors, (353), 264 states have internal predecessors, (353), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-24 06:11:37,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 527 transitions. [2024-10-24 06:11:37,133 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 527 transitions. Word has length 182 [2024-10-24 06:11:37,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:11:37,134 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 527 transitions. [2024-10-24 06:11:37,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 06:11:37,135 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 527 transitions. [2024-10-24 06:11:37,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-24 06:11:37,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:11:37,137 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:11:37,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 06:11:37,138 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:11:37,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:11:37,138 INFO L85 PathProgramCache]: Analyzing trace with hash 771846706, now seen corresponding path program 1 times [2024-10-24 06:11:37,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:11:37,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141770735] [2024-10-24 06:11:37,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:37,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:11:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:11:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:11:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:11:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:11:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:11:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:11:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:11:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:11:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:11:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:11:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:11:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:11:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:11:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:11:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:11:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:11:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:11:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:11:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:11:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:11:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:11:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:11:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:11:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:11:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:11:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:11:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:11:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:11:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:11:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 06:11:37,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:11:37,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141770735] [2024-10-24 06:11:37,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141770735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:11:37,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:11:37,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:11:37,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921275444] [2024-10-24 06:11:37,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:11:37,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:11:37,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:11:37,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:11:37,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:11:37,397 INFO L87 Difference]: Start difference. First operand 355 states and 527 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 06:11:37,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:11:37,434 INFO L93 Difference]: Finished difference Result 710 states and 1055 transitions. [2024-10-24 06:11:37,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:11:37,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 183 [2024-10-24 06:11:37,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:11:37,437 INFO L225 Difference]: With dead ends: 710 [2024-10-24 06:11:37,438 INFO L226 Difference]: Without dead ends: 356 [2024-10-24 06:11:37,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:11:37,443 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:11:37,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:11:37,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-24 06:11:37,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2024-10-24 06:11:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 265 states have (on average 1.3283018867924528) internal successors, (352), 265 states have internal predecessors, (352), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-24 06:11:37,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 526 transitions. [2024-10-24 06:11:37,482 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 526 transitions. Word has length 183 [2024-10-24 06:11:37,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:11:37,482 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 526 transitions. [2024-10-24 06:11:37,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 06:11:37,483 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 526 transitions. [2024-10-24 06:11:37,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-24 06:11:37,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:11:37,486 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:11:37,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 06:11:37,488 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:11:37,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:11:37,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1030012144, now seen corresponding path program 1 times [2024-10-24 06:11:37,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:11:37,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46397397] [2024-10-24 06:11:37,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:37,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:11:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:11:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:11:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:11:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:11:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:11:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:11:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:11:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:11:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:11:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:11:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:11:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:11:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:11:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:11:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:11:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:11:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:11:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:11:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:11:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:11:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:11:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:11:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:11:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:11:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:11:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:11:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:11:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:11:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:11:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:37,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 06:11:37,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:11:37,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46397397] [2024-10-24 06:11:37,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46397397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:11:37,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:11:37,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:11:37,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401507701] [2024-10-24 06:11:37,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:11:37,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:11:37,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:11:37,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:11:37,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:11:37,820 INFO L87 Difference]: Start difference. First operand 356 states and 526 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 06:11:38,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:11:38,231 INFO L93 Difference]: Finished difference Result 635 states and 950 transitions. [2024-10-24 06:11:38,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 06:11:38,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 183 [2024-10-24 06:11:38,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:11:38,236 INFO L225 Difference]: With dead ends: 635 [2024-10-24 06:11:38,237 INFO L226 Difference]: Without dead ends: 514 [2024-10-24 06:11:38,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:11:38,238 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 256 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 06:11:38,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 898 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 06:11:38,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-10-24 06:11:38,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 363. [2024-10-24 06:11:38,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 272 states have (on average 1.3308823529411764) internal successors, (362), 272 states have internal predecessors, (362), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-24 06:11:38,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 536 transitions. [2024-10-24 06:11:38,284 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 536 transitions. Word has length 183 [2024-10-24 06:11:38,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:11:38,285 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 536 transitions. [2024-10-24 06:11:38,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 06:11:38,285 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 536 transitions. [2024-10-24 06:11:38,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-24 06:11:38,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:11:38,287 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:11:38,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 06:11:38,288 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:11:38,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:11:38,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1366616771, now seen corresponding path program 1 times [2024-10-24 06:11:38,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:11:38,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736387360] [2024-10-24 06:11:38,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:38,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:11:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:11:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:11:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:11:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:11:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:11:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:11:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:11:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:11:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:11:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:11:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:11:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:11:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:11:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:11:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:11:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:11:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:11:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:11:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:11:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:11:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:11:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:11:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:11:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:11:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:11:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:11:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:11:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:11:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:11:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 06:11:38,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:11:38,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736387360] [2024-10-24 06:11:38,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736387360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:11:38,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:11:38,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:11:38,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222885703] [2024-10-24 06:11:38,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:11:38,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:11:38,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:11:38,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:11:38,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:11:38,709 INFO L87 Difference]: Start difference. First operand 363 states and 536 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 06:11:38,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:11:38,818 INFO L93 Difference]: Finished difference Result 783 states and 1162 transitions. [2024-10-24 06:11:38,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:11:38,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 183 [2024-10-24 06:11:38,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:11:38,822 INFO L225 Difference]: With dead ends: 783 [2024-10-24 06:11:38,822 INFO L226 Difference]: Without dead ends: 421 [2024-10-24 06:11:38,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:11:38,825 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 130 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:11:38,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 579 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:11:38,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-24 06:11:38,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 363. [2024-10-24 06:11:38,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 272 states have (on average 1.3014705882352942) internal successors, (354), 272 states have internal predecessors, (354), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-24 06:11:38,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 528 transitions. [2024-10-24 06:11:38,886 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 528 transitions. Word has length 183 [2024-10-24 06:11:38,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:11:38,886 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 528 transitions. [2024-10-24 06:11:38,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 06:11:38,887 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 528 transitions. [2024-10-24 06:11:38,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-24 06:11:38,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:11:38,889 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:11:38,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 06:11:38,890 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:11:38,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:11:38,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2122152352, now seen corresponding path program 1 times [2024-10-24 06:11:38,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:11:38,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638010567] [2024-10-24 06:11:38,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:38,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:11:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:11:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:11:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:11:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:11:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:11:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:11:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:11:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:11:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:11:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:11:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:11:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:11:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:11:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:11:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:11:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:11:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:11:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:11:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:11:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:11:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:11:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:11:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:11:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:11:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:11:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:11:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:11:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:11:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:11:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:39,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 06:11:39,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:11:39,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638010567] [2024-10-24 06:11:39,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638010567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:11:39,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:11:39,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:11:39,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375524129] [2024-10-24 06:11:39,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:11:39,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:11:39,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:11:39,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:11:39,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:11:39,209 INFO L87 Difference]: Start difference. First operand 363 states and 528 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 06:11:39,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:11:39,949 INFO L93 Difference]: Finished difference Result 964 states and 1392 transitions. [2024-10-24 06:11:39,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 06:11:39,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-10-24 06:11:39,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:11:39,956 INFO L225 Difference]: With dead ends: 964 [2024-10-24 06:11:39,956 INFO L226 Difference]: Without dead ends: 836 [2024-10-24 06:11:39,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 06:11:39,958 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 325 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 06:11:39,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 637 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 06:11:39,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2024-10-24 06:11:40,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 622. [2024-10-24 06:11:40,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 471 states have (on average 1.3014861995753715) internal successors, (613), 471 states have internal predecessors, (613), 145 states have call successors, (145), 5 states have call predecessors, (145), 5 states have return successors, (145), 145 states have call predecessors, (145), 145 states have call successors, (145) [2024-10-24 06:11:40,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 903 transitions. [2024-10-24 06:11:40,105 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 903 transitions. Word has length 187 [2024-10-24 06:11:40,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:11:40,106 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 903 transitions. [2024-10-24 06:11:40,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 06:11:40,107 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 903 transitions. [2024-10-24 06:11:40,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-24 06:11:40,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:11:40,109 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:11:40,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 06:11:40,109 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:11:40,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:11:40,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1029143846, now seen corresponding path program 1 times [2024-10-24 06:11:40,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:11:40,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344526597] [2024-10-24 06:11:40,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:40,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:11:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:11:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:11:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:11:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:11:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:11:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:11:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:11:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:11:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:11:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:11:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:11:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:11:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:11:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:11:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:11:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:11:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:11:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 06:11:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:11:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 06:11:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:11:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:11:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:11:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:11:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:11:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 06:11:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:11:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:11:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:11:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:47,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 06:11:47,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:11:47,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344526597] [2024-10-24 06:11:47,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344526597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:11:47,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:11:47,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 06:11:47,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120251924] [2024-10-24 06:11:47,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:11:47,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 06:11:47,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:11:47,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 06:11:47,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-24 06:11:47,251 INFO L87 Difference]: Start difference. First operand 622 states and 903 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 06:11:49,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:11:49,350 INFO L93 Difference]: Finished difference Result 1298 states and 1829 transitions. [2024-10-24 06:11:49,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 06:11:49,352 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-10-24 06:11:49,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:11:49,358 INFO L225 Difference]: With dead ends: 1298 [2024-10-24 06:11:49,359 INFO L226 Difference]: Without dead ends: 1058 [2024-10-24 06:11:49,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-24 06:11:49,362 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 182 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 06:11:49,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 561 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 06:11:49,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2024-10-24 06:11:49,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 987. [2024-10-24 06:11:49,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 821 states have (on average 1.3069427527405604) internal successors, (1073), 826 states have internal predecessors, (1073), 155 states have call successors, (155), 10 states have call predecessors, (155), 10 states have return successors, (155), 150 states have call predecessors, (155), 155 states have call successors, (155) [2024-10-24 06:11:49,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1383 transitions. [2024-10-24 06:11:49,493 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1383 transitions. Word has length 187 [2024-10-24 06:11:49,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:11:49,493 INFO L471 AbstractCegarLoop]: Abstraction has 987 states and 1383 transitions. [2024-10-24 06:11:49,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 06:11:49,494 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1383 transitions. [2024-10-24 06:11:49,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-24 06:11:49,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:11:49,497 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:11:49,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 06:11:49,498 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:11:49,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:11:49,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1247998564, now seen corresponding path program 1 times [2024-10-24 06:11:49,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:11:49,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62408071] [2024-10-24 06:11:49,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:49,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:11:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:11:49,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 06:11:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:11:49,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 06:11:49,750 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 06:11:49,751 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 06:11:49,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 06:11:49,757 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:11:49,919 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 06:11:49,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:11:49 BoogieIcfgContainer [2024-10-24 06:11:49,923 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 06:11:49,924 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 06:11:49,924 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 06:11:49,924 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 06:11:49,925 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:11:33" (3/4) ... [2024-10-24 06:11:49,927 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 06:11:49,928 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 06:11:49,929 INFO L158 Benchmark]: Toolchain (without parser) took 18114.85ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 118.6MB in the beginning and 149.7MB in the end (delta: -31.2MB). Peak memory consumption was 153.6MB. Max. memory is 16.1GB. [2024-10-24 06:11:49,929 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 59.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:11:49,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.38ms. Allocated memory is still 167.8MB. Free memory was 118.0MB in the beginning and 101.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 06:11:49,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.91ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 97.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 06:11:49,930 INFO L158 Benchmark]: Boogie Preprocessor took 90.77ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 90.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 06:11:49,930 INFO L158 Benchmark]: RCFGBuilder took 783.98ms. Allocated memory is still 167.8MB. Free memory was 90.7MB in the beginning and 108.5MB in the end (delta: -17.8MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-10-24 06:11:49,931 INFO L158 Benchmark]: TraceAbstraction took 16713.75ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 108.5MB in the beginning and 149.7MB in the end (delta: -41.2MB). Peak memory consumption was 145.1MB. Max. memory is 16.1GB. [2024-10-24 06:11:49,931 INFO L158 Benchmark]: Witness Printer took 4.49ms. Allocated memory is still 352.3MB. Free memory is still 149.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:11:49,932 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.16ms. Allocated memory is still 96.5MB. Free memory is still 59.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.38ms. Allocated memory is still 167.8MB. Free memory was 118.0MB in the beginning and 101.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.91ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 97.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.77ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 90.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 783.98ms. Allocated memory is still 167.8MB. Free memory was 90.7MB in the beginning and 108.5MB in the end (delta: -17.8MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * TraceAbstraction took 16713.75ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 108.5MB in the beginning and 149.7MB in the end (delta: -41.2MB). Peak memory consumption was 145.1MB. Max. memory is 16.1GB. * Witness Printer took 4.49ms. Allocated memory is still 352.3MB. Free memory is still 149.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 165. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed short int var_1_24 = -4; [L40] unsigned char var_1_25 = 1; [L41] signed char var_1_26 = 50; [L42] signed char var_1_27 = 4; [L43] signed char var_1_28 = -10; [L44] signed char var_1_29 = -64; [L45] signed char var_1_30 = -8; [L46] signed long int var_1_31 = 1; [L47] float var_1_32 = 3.75; [L48] float var_1_33 = 8.5; [L49] unsigned char var_1_34 = 0; [L50] unsigned char var_1_35 = 8; [L51] unsigned short int var_1_36 = 5; [L52] signed long int last_1_var_1_5 = 5; [L169] isInitial = 1 [L170] FCALL initially() [L171] COND TRUE 1 [L172] CALL updateLastVariables() [L162] last_1_var_1_5 = var_1_5 [L172] RET updateLastVariables() [L173] CALL updateVariables() [L115] var_1_9 = __VERIFIER_nondet_float() [L116] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L116] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L117] var_1_10 = __VERIFIER_nondet_float() [L118] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L118] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L119] var_1_11 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L120] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L121] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L121] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L122] var_1_12 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L123] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L124] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L124] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L125] var_1_13 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L126] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L127] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L127] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L128] var_1_14 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L129] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L130] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L130] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L131] var_1_18 = __VERIFIER_nondet_char() [L132] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L132] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L133] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L133] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L134] var_1_19 = __VERIFIER_nondet_char() [L135] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L135] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L136] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L136] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L137] var_1_23 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L138] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L139] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L139] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L140] var_1_25 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L141] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L142] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L142] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L143] var_1_26 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_26 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L144] RET assume_abort_if_not(var_1_26 >= -128) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L145] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L145] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L146] var_1_27 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_27 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L147] RET assume_abort_if_not(var_1_27 >= -128) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L148] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L148] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L149] var_1_28 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_28 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L150] RET assume_abort_if_not(var_1_28 >= -128) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L151] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L151] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L152] var_1_30 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_30 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L153] RET assume_abort_if_not(var_1_30 >= -127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L154] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L154] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L155] var_1_33 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L156] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L157] var_1_35 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_36=5, var_1_5=5, var_1_8=0] [L158] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_36=5, var_1_5=5, var_1_8=0] [L159] CALL assume_abort_if_not(var_1_35 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=254, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=254, var_1_36=5, var_1_5=5, var_1_8=0] [L159] RET assume_abort_if_not(var_1_35 <= 254) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=254, var_1_36=5, var_1_5=5, var_1_8=0] [L173] RET updateVariables() [L174] CALL step() [L56] COND FALSE !(\read(var_1_25)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=254, var_1_36=5, var_1_5=5, var_1_8=0] [L61] var_1_29 = var_1_30 [L62] var_1_31 = var_1_29 [L63] var_1_32 = var_1_33 [L64] var_1_34 = var_1_35 [L65] var_1_36 = var_1_35 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L66] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L69] var_1_20 = var_1_8 [L70] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L71] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L74] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=1, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L75] COND FALSE !(\read(var_1_22)) [L82] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L84] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L85] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L86] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L87] COND FALSE !(\read(var_1_22)) [L94] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L99] signed long int stepLocal_4 = 256; [L100] unsigned char stepLocal_3 = var_1_22; [L101] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L102] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L105] COND FALSE !(stepLocal_3 || var_1_22) [L110] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L174] RET step() [L175] CALL, EXPR property() [L165] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165-L166] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L175] RET, EXPR property() [L175] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=261, var_1_33=261, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.5s, OverallIterations: 10, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1464 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1464 mSDsluCounter, 4639 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2778 mSDsCounter, 452 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1341 IncrementalHoareTripleChecker+Invalid, 1793 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 452 mSolverCounterUnsat, 1861 mSDtfsCounter, 1341 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 614 GetRequests, 575 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=987occurred in iteration=9, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 641 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 1835 NumberOfCodeBlocks, 1835 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1639 ConstructedInterpolants, 0 QuantifiedInterpolants, 11167 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 14616/14616 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 06:11:49,984 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.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 f0e464b03528fd07ed2a214c41d5d0c75fd807ee4909056da113988031a11e66 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:11:52,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:11:52,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 06:11:52,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:11:52,513 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:11:52,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:11:52,552 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:11:52,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:11:52,553 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:11:52,554 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:11:52,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:11:52,555 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:11:52,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:11:52,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:11:52,556 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:11:52,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:11:52,557 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:11:52,558 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:11:52,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:11:52,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:11:52,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:11:52,563 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:11:52,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:11:52,564 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 06:11:52,564 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 06:11:52,565 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:11:52,565 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 06:11:52,565 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:11:52,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:11:52,566 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:11:52,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:11:52,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:11:52,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:11:52,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:11:52,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:11:52,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:11:52,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:11:52,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:11:52,571 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 06:11:52,571 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 06:11:52,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:11:52,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:11:52,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:11:52,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:11:52,573 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 06:11:52,573 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 -> f0e464b03528fd07ed2a214c41d5d0c75fd807ee4909056da113988031a11e66 [2024-10-24 06:11:52,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:11:52,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:11:52,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:11:52,985 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:11:52,986 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:11:52,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2024-10-24 06:11:54,793 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:11:55,046 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:11:55,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2024-10-24 06:11:55,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a58d0ed/e019415eccb84ecc8f872775dc568735/FLAG0f49539a7 [2024-10-24 06:11:55,088 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a58d0ed/e019415eccb84ecc8f872775dc568735 [2024-10-24 06:11:55,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:11:55,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:11:55,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:11:55,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:11:55,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:11:55,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:11:55" (1/1) ... [2024-10-24 06:11:55,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2026677f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:55, skipping insertion in model container [2024-10-24 06:11:55,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:11:55" (1/1) ... [2024-10-24 06:11:55,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:11:55,344 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i[915,928] [2024-10-24 06:11:55,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:11:55,447 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:11:55,460 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i[915,928] [2024-10-24 06:11:55,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:11:55,530 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:11:55,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:55 WrapperNode [2024-10-24 06:11:55,531 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:11:55,532 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:11:55,532 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:11:55,532 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:11:55,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:55" (1/1) ... [2024-10-24 06:11:55,557 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:55" (1/1) ... [2024-10-24 06:11:55,601 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2024-10-24 06:11:55,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:11:55,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:11:55,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:11:55,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:11:55,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:55" (1/1) ... [2024-10-24 06:11:55,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:55" (1/1) ... [2024-10-24 06:11:55,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:55" (1/1) ... [2024-10-24 06:11:55,654 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 06:11:55,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:55" (1/1) ... [2024-10-24 06:11:55,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:55" (1/1) ... [2024-10-24 06:11:55,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:55" (1/1) ... [2024-10-24 06:11:55,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:55" (1/1) ... [2024-10-24 06:11:55,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:55" (1/1) ... [2024-10-24 06:11:55,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:55" (1/1) ... [2024-10-24 06:11:55,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:11:55,698 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:11:55,699 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:11:55,699 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:11:55,700 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:55" (1/1) ... [2024-10-24 06:11:55,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:11:55,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:11:55,750 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:11:55,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:11:55,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:11:55,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 06:11:55,805 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:11:55,806 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:11:55,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:11:55,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:11:55,896 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:11:55,902 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:11:56,303 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-24 06:11:56,304 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:11:56,361 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:11:56,362 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:11:56,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:11:56 BoogieIcfgContainer [2024-10-24 06:11:56,364 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:11:56,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:11:56,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:11:56,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:11:56,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:11:55" (1/3) ... [2024-10-24 06:11:56,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fcf236a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:11:56, skipping insertion in model container [2024-10-24 06:11:56,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:11:55" (2/3) ... [2024-10-24 06:11:56,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fcf236a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:11:56, skipping insertion in model container [2024-10-24 06:11:56,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:11:56" (3/3) ... [2024-10-24 06:11:56,375 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2024-10-24 06:11:56,394 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:11:56,395 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:11:56,472 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:11:56,480 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;@fc8d61d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:11:56,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:11:56,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 06:11:56,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-24 06:11:56,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:11:56,504 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:11:56,504 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:11:56,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:11:56,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1998912747, now seen corresponding path program 1 times [2024-10-24 06:11:56,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:11:56,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399904218] [2024-10-24 06:11:56,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:56,530 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:11:56,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:11:56,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:11:56,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 06:11:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:56,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 06:11:56,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:11:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 804 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-10-24 06:11:56,969 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:11:56,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:11:56,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399904218] [2024-10-24 06:11:56,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399904218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:11:56,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:11:56,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:11:56,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274108568] [2024-10-24 06:11:56,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:11:56,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:11:56,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:11:57,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:11:57,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:11:57,012 INFO L87 Difference]: Start difference. First operand has 75 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-24 06:11:57,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:11:57,072 INFO L93 Difference]: Finished difference Result 147 states and 263 transitions. [2024-10-24 06:11:57,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:11:57,076 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 177 [2024-10-24 06:11:57,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:11:57,084 INFO L225 Difference]: With dead ends: 147 [2024-10-24 06:11:57,084 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 06:11:57,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:11:57,091 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:11:57,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:11:57,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 06:11:57,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-24 06:11:57,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 06:11:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 113 transitions. [2024-10-24 06:11:57,140 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 113 transitions. Word has length 177 [2024-10-24 06:11:57,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:11:57,141 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 113 transitions. [2024-10-24 06:11:57,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-24 06:11:57,142 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 113 transitions. [2024-10-24 06:11:57,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-24 06:11:57,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:11:57,145 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:11:57,156 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 (2)] Forceful destruction successful, exit code 0 [2024-10-24 06:11:57,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:11:57,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:11:57,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:11:57,348 INFO L85 PathProgramCache]: Analyzing trace with hash 603145819, now seen corresponding path program 1 times [2024-10-24 06:11:57,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:11:57,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072909810] [2024-10-24 06:11:57,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:57,350 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:11:57,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:11:57,353 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:11:57,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 06:11:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:57,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 06:11:57,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:11:57,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 838 proven. 39 refuted. 0 times theorem prover too weak. 747 trivial. 0 not checked. [2024-10-24 06:11:57,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:11:58,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 45 proven. 39 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-24 06:11:58,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:11:58,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072909810] [2024-10-24 06:11:58,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072909810] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:11:58,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 06:11:58,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-24 06:11:58,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470950817] [2024-10-24 06:11:58,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 06:11:58,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 06:11:58,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:11:58,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 06:11:58,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 06:11:58,126 INFO L87 Difference]: Start difference. First operand 73 states and 113 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2024-10-24 06:11:58,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:11:58,546 INFO L93 Difference]: Finished difference Result 151 states and 228 transitions. [2024-10-24 06:11:58,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 06:11:58,547 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 177 [2024-10-24 06:11:58,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:11:58,550 INFO L225 Difference]: With dead ends: 151 [2024-10-24 06:11:58,550 INFO L226 Difference]: Without dead ends: 79 [2024-10-24 06:11:58,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-10-24 06:11:58,553 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 88 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 06:11:58,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 137 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 06:11:58,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-24 06:11:58,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2024-10-24 06:11:58,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 06:11:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2024-10-24 06:11:58,580 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 177 [2024-10-24 06:11:58,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:11:58,581 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2024-10-24 06:11:58,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2024-10-24 06:11:58,582 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2024-10-24 06:11:58,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-24 06:11:58,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:11:58,585 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:11:58,594 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 (3)] Ended with exit code 0 [2024-10-24 06:11:58,786 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-10-24 06:11:58,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:11:58,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:11:58,788 INFO L85 PathProgramCache]: Analyzing trace with hash 210118809, now seen corresponding path program 1 times [2024-10-24 06:11:58,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:11:58,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676336168] [2024-10-24 06:11:58,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:58,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:11:58,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:11:58,793 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-10-24 06:11:58,794 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-10-24 06:11:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:11:58,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 06:11:58,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:11:59,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 06:11:59,372 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:11:59,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:11:59,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676336168] [2024-10-24 06:11:59,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676336168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:11:59,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:11:59,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:11:59,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770490132] [2024-10-24 06:11:59,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:11:59,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:11:59,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:11:59,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:11:59,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:11:59,376 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 06:11:59,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:11:59,707 INFO L93 Difference]: Finished difference Result 208 states and 306 transitions. [2024-10-24 06:11:59,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:11:59,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 177 [2024-10-24 06:11:59,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:11:59,710 INFO L225 Difference]: With dead ends: 208 [2024-10-24 06:11:59,710 INFO L226 Difference]: Without dead ends: 134 [2024-10-24 06:11:59,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 173 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-10-24 06:11:59,714 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 104 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 06:11:59,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 384 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 06:11:59,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-24 06:11:59,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 75. [2024-10-24 06:11:59,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 06:11:59,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 108 transitions. [2024-10-24 06:11:59,748 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 108 transitions. Word has length 177 [2024-10-24 06:11:59,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:11:59,748 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 108 transitions. [2024-10-24 06:11:59,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 06:11:59,749 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 108 transitions. [2024-10-24 06:11:59,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-24 06:11:59,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:11:59,756 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:11:59,765 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 (4)] Forceful destruction successful, exit code 0 [2024-10-24 06:11:59,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:11:59,957 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:11:59,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:11:59,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1765421424, now seen corresponding path program 1 times [2024-10-24 06:11:59,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:11:59,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37813332] [2024-10-24 06:11:59,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:11:59,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:11:59,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:11:59,962 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:11:59,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 06:12:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:12:00,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 06:12:00,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:12:00,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 06:12:00,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:12:00,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:12:00,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37813332] [2024-10-24 06:12:00,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37813332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:12:00,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:12:00,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:12:00,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756531417] [2024-10-24 06:12:00,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:12:00,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:12:00,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:12:00,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:12:00,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:12:00,942 INFO L87 Difference]: Start difference. First operand 75 states and 108 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 06:12:01,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:12:01,250 INFO L93 Difference]: Finished difference Result 229 states and 328 transitions. [2024-10-24 06:12:01,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:12:01,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 178 [2024-10-24 06:12:01,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:12:01,254 INFO L225 Difference]: With dead ends: 229 [2024-10-24 06:12:01,254 INFO L226 Difference]: Without dead ends: 155 [2024-10-24 06:12:01,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:12:01,256 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 57 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:12:01,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 330 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:12:01,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-24 06:12:01,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 147. [2024-10-24 06:12:01,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 84 states have (on average 1.1547619047619047) internal successors, (97), 84 states have internal predecessors, (97), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-24 06:12:01,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 213 transitions. [2024-10-24 06:12:01,299 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 213 transitions. Word has length 178 [2024-10-24 06:12:01,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:12:01,300 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 213 transitions. [2024-10-24 06:12:01,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 06:12:01,301 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 213 transitions. [2024-10-24 06:12:01,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 06:12:01,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:12:01,303 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:12:01,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 06:12:01,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:12:01,504 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:12:01,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:12:01,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1105641082, now seen corresponding path program 1 times [2024-10-24 06:12:01,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:12:01,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010528579] [2024-10-24 06:12:01,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:12:01,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:12:01,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:12:01,508 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:12:01,510 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 (6)] Waiting until timeout for monitored process [2024-10-24 06:12:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:12:01,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 06:12:01,904 INFO L278 TraceCheckSpWp]: Computing forward predicates...