./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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_fillercodestructure_filler-ps-co_file-42.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 f02b4d764a6f2b9378677160d85f84fe71fe9bb12a30ec7a53966c7051db5504 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:30:10,087 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:30:10,150 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 05:30:10,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:30:10,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:30:10,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:30:10,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:30:10,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:30:10,187 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:30:10,187 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:30:10,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:30:10,188 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:30:10,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:30:10,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:30:10,189 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:30:10,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:30:10,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:30:10,190 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:30:10,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 05:30:10,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:30:10,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:30:10,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:30:10,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:30:10,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:30:10,195 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:30:10,195 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:30:10,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:30:10,196 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:30:10,196 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:30:10,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:30:10,197 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:30:10,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:30:10,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:30:10,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:30:10,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:30:10,198 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:30:10,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 05:30:10,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 05:30:10,199 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:30:10,199 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:30:10,199 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:30:10,199 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:30:10,199 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 -> f02b4d764a6f2b9378677160d85f84fe71fe9bb12a30ec7a53966c7051db5504 [2024-11-20 05:30:10,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:30:10,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:30:10,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:30:10,421 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:30:10,421 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:30:10,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i [2024-11-20 05:30:11,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:30:11,856 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:30:11,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i [2024-11-20 05:30:11,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9648e17/0bb0f551f012415992d246fb8639bf71/FLAG685b73ac1 [2024-11-20 05:30:12,251 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9648e17/0bb0f551f012415992d246fb8639bf71 [2024-11-20 05:30:12,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:30:12,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:30:12,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:30:12,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:30:12,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:30:12,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:30:12" (1/1) ... [2024-11-20 05:30:12,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a01cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:12, skipping insertion in model container [2024-11-20 05:30:12,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:30:12" (1/1) ... [2024-11-20 05:30:12,287 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:30:12,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i[919,932] [2024-11-20 05:30:12,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:30:12,462 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:30:12,471 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i[919,932] [2024-11-20 05:30:12,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:30:12,514 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:30:12,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:12 WrapperNode [2024-11-20 05:30:12,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:30:12,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:30:12,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:30:12,518 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:30:12,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:12" (1/1) ... [2024-11-20 05:30:12,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:12" (1/1) ... [2024-11-20 05:30:12,569 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 207 [2024-11-20 05:30:12,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:30:12,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:30:12,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:30:12,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:30:12,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:12" (1/1) ... [2024-11-20 05:30:12,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:12" (1/1) ... [2024-11-20 05:30:12,583 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:12" (1/1) ... [2024-11-20 05:30:12,615 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 05:30:12,615 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:12" (1/1) ... [2024-11-20 05:30:12,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:12" (1/1) ... [2024-11-20 05:30:12,629 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:12" (1/1) ... [2024-11-20 05:30:12,632 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:12" (1/1) ... [2024-11-20 05:30:12,639 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:12" (1/1) ... [2024-11-20 05:30:12,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:12" (1/1) ... [2024-11-20 05:30:12,647 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:30:12,648 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:30:12,648 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:30:12,649 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:30:12,649 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:12" (1/1) ... [2024-11-20 05:30:12,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:30:12,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:30:12,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 05:30:12,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 05:30:12,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:30:12,717 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:30:12,718 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:30:12,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 05:30:12,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:30:12,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:30:12,788 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:30:12,789 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:30:13,108 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-20 05:30:13,108 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:30:13,123 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:30:13,125 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:30:13,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:30:13 BoogieIcfgContainer [2024-11-20 05:30:13,126 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:30:13,128 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:30:13,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:30:13,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:30:13,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:30:12" (1/3) ... [2024-11-20 05:30:13,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f155c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:30:13, skipping insertion in model container [2024-11-20 05:30:13,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:12" (2/3) ... [2024-11-20 05:30:13,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f155c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:30:13, skipping insertion in model container [2024-11-20 05:30:13,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:30:13" (3/3) ... [2024-11-20 05:30:13,134 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i [2024-11-20 05:30:13,147 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:30:13,148 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:30:13,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:30:13,210 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;@2ca41789, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:30:13,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:30:13,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 59 states have internal predecessors, (84), 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-11-20 05:30:13,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 05:30:13,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:30:13,228 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, 1, 1, 1, 1] [2024-11-20 05:30:13,228 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:30:13,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:30:13,232 INFO L85 PathProgramCache]: Analyzing trace with hash -780663087, now seen corresponding path program 1 times [2024-11-20 05:30:13,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:30:13,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857975958] [2024-11-20 05:30:13,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:13,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:30:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:30:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:30:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:30:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:30:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:30:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:30:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:30:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:30:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:30:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:30:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:30:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:30:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:30:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:30:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:30:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 05:30:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:30:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:30:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:30:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:30:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 05:30:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:30:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 05:30:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 05:30:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 05:30:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 05:30:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 05:30:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 05:30:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 05:30:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 05:30:13,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:30:13,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857975958] [2024-11-20 05:30:13,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857975958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:30:13,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:30:13,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:30:13,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735049267] [2024-11-20 05:30:13,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:30:13,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:30:13,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:30:13,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:30:13,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:30:13,671 INFO L87 Difference]: Start difference. First operand has 90 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 59 states have internal predecessors, (84), 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 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-11-20 05:30:13,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:30:13,703 INFO L93 Difference]: Finished difference Result 173 states and 307 transitions. [2024-11-20 05:30:13,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:30:13,705 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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 191 [2024-11-20 05:30:13,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:30:13,711 INFO L225 Difference]: With dead ends: 173 [2024-11-20 05:30:13,711 INFO L226 Difference]: Without dead ends: 86 [2024-11-20 05:30:13,714 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-11-20 05:30:13,718 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:30:13,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:30:13,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-20 05:30:13,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-20 05:30:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 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-11-20 05:30:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 133 transitions. [2024-11-20 05:30:13,755 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 133 transitions. Word has length 191 [2024-11-20 05:30:13,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:30:13,756 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 133 transitions. [2024-11-20 05:30:13,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-11-20 05:30:13,756 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 133 transitions. [2024-11-20 05:30:13,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 05:30:13,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:30:13,759 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, 1, 1, 1, 1] [2024-11-20 05:30:13,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 05:30:13,760 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:30:13,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:30:13,764 INFO L85 PathProgramCache]: Analyzing trace with hash -286786807, now seen corresponding path program 1 times [2024-11-20 05:30:13,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:30:13,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339663211] [2024-11-20 05:30:13,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:13,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:30:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:30:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:30:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:30:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:30:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:30:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:30:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:30:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:30:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:30:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:30:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:30:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:30:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:30:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:30:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:30:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 05:30:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:13,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:30:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:30:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:30:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:30:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 05:30:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:30:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 05:30:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 05:30:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 05:30:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 05:30:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 05:30:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 05:30:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 05:30:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 05:30:14,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:30:14,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339663211] [2024-11-20 05:30:14,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339663211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:30:14,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:30:14,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:30:14,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129220212] [2024-11-20 05:30:14,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:30:14,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:30:14,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:30:14,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:30:14,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:30:14,042 INFO L87 Difference]: Start difference. First operand 86 states and 133 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-11-20 05:30:14,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:30:14,109 INFO L93 Difference]: Finished difference Result 220 states and 340 transitions. [2024-11-20 05:30:14,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:30:14,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 191 [2024-11-20 05:30:14,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:30:14,111 INFO L225 Difference]: With dead ends: 220 [2024-11-20 05:30:14,111 INFO L226 Difference]: Without dead ends: 137 [2024-11-20 05:30:14,112 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-11-20 05:30:14,113 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 75 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:30:14,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 292 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:30:14,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-20 05:30:14,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2024-11-20 05:30:14,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 91 states have internal predecessors, (125), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-20 05:30:14,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 207 transitions. [2024-11-20 05:30:14,132 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 207 transitions. Word has length 191 [2024-11-20 05:30:14,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:30:14,134 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 207 transitions. [2024-11-20 05:30:14,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-11-20 05:30:14,135 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 207 transitions. [2024-11-20 05:30:14,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 05:30:14,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:30:14,142 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, 1, 1, 1, 1] [2024-11-20 05:30:14,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 05:30:14,142 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:30:14,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:30:14,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1975730549, now seen corresponding path program 1 times [2024-11-20 05:30:14,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:30:14,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974818274] [2024-11-20 05:30:14,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:14,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:30:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:30:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:30:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:30:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:30:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:30:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:30:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:30:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:30:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:30:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:30:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:30:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:30:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:30:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:30:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:30:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 05:30:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:30:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:30:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:30:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:30:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 05:30:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:30:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 05:30:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 05:30:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 05:30:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 05:30:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 05:30:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 05:30:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 05:30:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:14,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 05:30:14,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:30:14,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974818274] [2024-11-20 05:30:14,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974818274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:30:14,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:30:14,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:30:14,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848967576] [2024-11-20 05:30:14,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:30:14,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:30:14,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:30:14,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:30:14,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:30:14,543 INFO L87 Difference]: Start difference. First operand 134 states and 207 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (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-11-20 05:30:14,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:30:14,706 INFO L93 Difference]: Finished difference Result 374 states and 582 transitions. [2024-11-20 05:30:14,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:30:14,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (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 191 [2024-11-20 05:30:14,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:30:14,714 INFO L225 Difference]: With dead ends: 374 [2024-11-20 05:30:14,714 INFO L226 Difference]: Without dead ends: 243 [2024-11-20 05:30:14,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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-11-20 05:30:14,717 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 105 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:30:14,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 378 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:30:14,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-20 05:30:14,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 203. [2024-11-20 05:30:14,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 129 states have (on average 1.3488372093023255) internal successors, (174), 130 states have internal predecessors, (174), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-20 05:30:14,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 314 transitions. [2024-11-20 05:30:14,762 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 314 transitions. Word has length 191 [2024-11-20 05:30:14,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:30:14,763 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 314 transitions. [2024-11-20 05:30:14,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (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-11-20 05:30:14,764 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 314 transitions. [2024-11-20 05:30:14,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 05:30:14,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:30:14,766 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, 1, 1, 1, 1, 1] [2024-11-20 05:30:14,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 05:30:14,767 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:30:14,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:30:14,767 INFO L85 PathProgramCache]: Analyzing trace with hash -920031123, now seen corresponding path program 1 times [2024-11-20 05:30:14,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:30:14,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254052429] [2024-11-20 05:30:14,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:14,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:30:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:30:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:30:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:30:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:30:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:30:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:30:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:30:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:30:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:30:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:30:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:30:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:30:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:30:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:30:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:30:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 05:30:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:30:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:30:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:30:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:30:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 05:30:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:30:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 05:30:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 05:30:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 05:30:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 05:30:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 05:30:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 05:30:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 05:30:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 05:30:15,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:30:15,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254052429] [2024-11-20 05:30:15,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254052429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:30:15,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:30:15,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 05:30:15,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665610801] [2024-11-20 05:30:15,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:30:15,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 05:30:15,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:30:15,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 05:30:15,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:30:15,209 INFO L87 Difference]: Start difference. First operand 203 states and 314 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-11-20 05:30:15,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:30:15,473 INFO L93 Difference]: Finished difference Result 551 states and 855 transitions. [2024-11-20 05:30:15,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 05:30:15,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 192 [2024-11-20 05:30:15,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:30:15,480 INFO L225 Difference]: With dead ends: 551 [2024-11-20 05:30:15,480 INFO L226 Difference]: Without dead ends: 420 [2024-11-20 05:30:15,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 05:30:15,484 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 163 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:30:15,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 467 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:30:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-20 05:30:15,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 332. [2024-11-20 05:30:15,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 215 states have (on average 1.3627906976744186) internal successors, (293), 217 states have internal predecessors, (293), 111 states have call successors, (111), 5 states have call predecessors, (111), 5 states have return successors, (111), 109 states have call predecessors, (111), 111 states have call successors, (111) [2024-11-20 05:30:15,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 515 transitions. [2024-11-20 05:30:15,531 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 515 transitions. Word has length 192 [2024-11-20 05:30:15,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:30:15,532 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 515 transitions. [2024-11-20 05:30:15,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-11-20 05:30:15,532 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 515 transitions. [2024-11-20 05:30:15,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 05:30:15,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:30:15,534 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, 1, 1, 1, 1, 1] [2024-11-20 05:30:15,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 05:30:15,534 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:30:15,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:30:15,534 INFO L85 PathProgramCache]: Analyzing trace with hash 2095072495, now seen corresponding path program 1 times [2024-11-20 05:30:15,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:30:15,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426653918] [2024-11-20 05:30:15,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:15,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:30:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:30:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:30:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:30:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:30:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:30:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:30:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:30:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:30:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:30:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:30:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:30:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:30:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:30:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:30:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:30:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 05:30:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:30:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:30:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:30:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:30:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 05:30:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:30:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 05:30:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 05:30:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 05:30:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 05:30:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 05:30:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 05:30:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 05:30:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:15,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 05:30:15,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:30:15,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426653918] [2024-11-20 05:30:15,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426653918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:30:15,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:30:15,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:30:15,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547067484] [2024-11-20 05:30:15,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:30:15,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:30:15,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:30:15,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:30:15,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:30:15,744 INFO L87 Difference]: Start difference. First operand 332 states and 515 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-11-20 05:30:15,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:30:15,791 INFO L93 Difference]: Finished difference Result 592 states and 920 transitions. [2024-11-20 05:30:15,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:30:15,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 192 [2024-11-20 05:30:15,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:30:15,795 INFO L225 Difference]: With dead ends: 592 [2024-11-20 05:30:15,795 INFO L226 Difference]: Without dead ends: 332 [2024-11-20 05:30:15,796 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-11-20 05:30:15,797 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 250 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-11-20 05:30:15,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 250 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:30:15,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-20 05:30:15,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2024-11-20 05:30:15,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 215 states have (on average 1.344186046511628) internal successors, (289), 217 states have internal predecessors, (289), 111 states have call successors, (111), 5 states have call predecessors, (111), 5 states have return successors, (111), 109 states have call predecessors, (111), 111 states have call successors, (111) [2024-11-20 05:30:15,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 511 transitions. [2024-11-20 05:30:15,835 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 511 transitions. Word has length 192 [2024-11-20 05:30:15,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:30:15,835 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 511 transitions. [2024-11-20 05:30:15,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-11-20 05:30:15,836 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 511 transitions. [2024-11-20 05:30:15,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 05:30:15,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:30:15,837 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, 1, 1, 1, 1, 1] [2024-11-20 05:30:15,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 05:30:15,838 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:30:15,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:30:15,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1519836431, now seen corresponding path program 1 times [2024-11-20 05:30:15,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:30:15,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289805641] [2024-11-20 05:30:15,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:15,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:30:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:30:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:30:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:30:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:30:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:30:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:30:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:30:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:30:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:30:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:30:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:30:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:30:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:30:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:30:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:30:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 05:30:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:30:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:30:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:30:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:30:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 05:30:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:30:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 05:30:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 05:30:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 05:30:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 05:30:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 05:30:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 05:30:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 05:30:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 36 proven. 48 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-20 05:30:16,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:30:16,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289805641] [2024-11-20 05:30:16,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289805641] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 05:30:16,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452546883] [2024-11-20 05:30:16,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:16,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:30:16,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:30:16,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 05:30:16,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 05:30:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:16,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 05:30:16,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:30:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 820 proven. 48 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2024-11-20 05:30:16,456 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:30:16,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 36 proven. 48 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-20 05:30:16,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452546883] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 05:30:16,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 05:30:16,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-20 05:30:16,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411546366] [2024-11-20 05:30:16,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 05:30:16,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 05:30:16,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:30:16,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 05:30:16,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 05:30:16,645 INFO L87 Difference]: Start difference. First operand 332 states and 511 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-20 05:30:16,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:30:16,804 INFO L93 Difference]: Finished difference Result 514 states and 782 transitions. [2024-11-20 05:30:16,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 05:30:16,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 192 [2024-11-20 05:30:16,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:30:16,806 INFO L225 Difference]: With dead ends: 514 [2024-11-20 05:30:16,806 INFO L226 Difference]: Without dead ends: 248 [2024-11-20 05:30:16,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 438 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-20 05:30:16,808 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 66 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:30:16,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 231 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:30:16,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-20 05:30:16,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 242. [2024-11-20 05:30:16,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 148 states have (on average 1.2567567567567568) internal successors, (186), 148 states have internal predecessors, (186), 87 states have call successors, (87), 6 states have call predecessors, (87), 6 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-20 05:30:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 360 transitions. [2024-11-20 05:30:16,830 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 360 transitions. Word has length 192 [2024-11-20 05:30:16,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:30:16,830 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 360 transitions. [2024-11-20 05:30:16,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-20 05:30:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 360 transitions. [2024-11-20 05:30:16,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 05:30:16,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:30:16,832 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, 1, 1, 1, 1, 1] [2024-11-20 05:30:16,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 05:30:17,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-20 05:30:17,033 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:30:17,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:30:17,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1124889807, now seen corresponding path program 1 times [2024-11-20 05:30:17,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:30:17,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687805407] [2024-11-20 05:30:17,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:17,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:30:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:30:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:30:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:30:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:30:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:30:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:30:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:30:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:30:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:30:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:30:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:30:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:30:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:30:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:30:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:30:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 05:30:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:30:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:30:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:30:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:30:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 05:30:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 05:30:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 05:30:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 05:30:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 05:30:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 05:30:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 05:30:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 05:30:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 05:30:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 51 proven. 111 refuted. 0 times theorem prover too weak. 1462 trivial. 0 not checked. [2024-11-20 05:30:17,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:30:17,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687805407] [2024-11-20 05:30:17,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687805407] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 05:30:17,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789723022] [2024-11-20 05:30:17,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:17,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:30:17,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:30:17,563 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 05:30:17,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 05:30:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:17,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 05:30:17,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:30:18,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 863 proven. 111 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-11-20 05:30:18,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:30:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 51 proven. 114 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2024-11-20 05:30:18,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789723022] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 05:30:18,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 05:30:18,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 23 [2024-11-20 05:30:18,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870246688] [2024-11-20 05:30:18,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 05:30:18,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-20 05:30:18,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:30:18,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-20 05:30:18,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2024-11-20 05:30:18,998 INFO L87 Difference]: Start difference. First operand 242 states and 360 transitions. Second operand has 23 states, 23 states have (on average 5.391304347826087) internal successors, (124), 23 states have internal predecessors, (124), 6 states have call successors, (58), 4 states have call predecessors, (58), 9 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) [2024-11-20 05:30:21,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:30:21,194 INFO L93 Difference]: Finished difference Result 948 states and 1328 transitions. [2024-11-20 05:30:21,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-11-20 05:30:21,195 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.391304347826087) internal successors, (124), 23 states have internal predecessors, (124), 6 states have call successors, (58), 4 states have call predecessors, (58), 9 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) Word has length 192 [2024-11-20 05:30:21,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:30:21,198 INFO L225 Difference]: With dead ends: 948 [2024-11-20 05:30:21,198 INFO L226 Difference]: Without dead ends: 861 [2024-11-20 05:30:21,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 436 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3456 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1957, Invalid=8143, Unknown=0, NotChecked=0, Total=10100 [2024-11-20 05:30:21,201 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 905 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 459 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 1849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 459 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:30:21,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1600 Invalid, 1849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [459 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 05:30:21,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-11-20 05:30:21,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 368. [2024-11-20 05:30:21,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 235 states have (on average 1.2425531914893617) internal successors, (292), 235 states have internal predecessors, (292), 116 states have call successors, (116), 16 states have call predecessors, (116), 16 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-20 05:30:21,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 524 transitions. [2024-11-20 05:30:21,237 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 524 transitions. Word has length 192 [2024-11-20 05:30:21,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:30:21,238 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 524 transitions. [2024-11-20 05:30:21,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.391304347826087) internal successors, (124), 23 states have internal predecessors, (124), 6 states have call successors, (58), 4 states have call predecessors, (58), 9 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) [2024-11-20 05:30:21,238 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 524 transitions. [2024-11-20 05:30:21,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 05:30:21,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:30:21,239 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, 1, 1, 1, 1, 1] [2024-11-20 05:30:21,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 05:30:21,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-20 05:30:21,444 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:30:21,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:30:21,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2136007057, now seen corresponding path program 1 times [2024-11-20 05:30:21,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:30:21,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550269133] [2024-11-20 05:30:21,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:21,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:30:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 05:30:21,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [609263749] [2024-11-20 05:30:21,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:21,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:30:21,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:30:21,511 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 05:30:21,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 05:30:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:21,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-20 05:30:21,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:30:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-20 05:30:22,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:30:23,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:30:23,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550269133] [2024-11-20 05:30:23,439 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 05:30:23,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609263749] [2024-11-20 05:30:23,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609263749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 05:30:23,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-20 05:30:23,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-20 05:30:23,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430492445] [2024-11-20 05:30:23,439 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-20 05:30:23,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 05:30:23,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:30:23,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 05:30:23,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-20 05:30:23,440 INFO L87 Difference]: Start difference. First operand 368 states and 524 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-20 05:30:24,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:30:24,126 INFO L93 Difference]: Finished difference Result 1088 states and 1526 transitions. [2024-11-20 05:30:24,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 05:30:24,126 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 192 [2024-11-20 05:30:24,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:30:24,131 INFO L225 Difference]: With dead ends: 1088 [2024-11-20 05:30:24,131 INFO L226 Difference]: Without dead ends: 795 [2024-11-20 05:30:24,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-11-20 05:30:24,133 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 189 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 05:30:24,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 762 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 05:30:24,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2024-11-20 05:30:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 662. [2024-11-20 05:30:24,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 426 states have (on average 1.2183098591549295) internal successors, (519), 426 states have internal predecessors, (519), 203 states have call successors, (203), 32 states have call predecessors, (203), 32 states have return successors, (203), 203 states have call predecessors, (203), 203 states have call successors, (203) [2024-11-20 05:30:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 925 transitions. [2024-11-20 05:30:24,209 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 925 transitions. Word has length 192 [2024-11-20 05:30:24,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:30:24,209 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 925 transitions. [2024-11-20 05:30:24,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-20 05:30:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 925 transitions. [2024-11-20 05:30:24,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 05:30:24,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:30:24,211 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, 1, 1, 1, 1, 1] [2024-11-20 05:30:24,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 05:30:24,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:30:24,412 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:30:24,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:30:24,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1549201043, now seen corresponding path program 1 times [2024-11-20 05:30:24,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:30:24,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927200750] [2024-11-20 05:30:24,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:24,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:30:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 05:30:24,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [700547523] [2024-11-20 05:30:24,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:24,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:30:24,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:30:24,466 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 05:30:24,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 05:30:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:24,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 05:30:24,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:30:25,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-20 05:30:25,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:30:25,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:30:25,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927200750] [2024-11-20 05:30:25,330 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 05:30:25,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700547523] [2024-11-20 05:30:25,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700547523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 05:30:25,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-20 05:30:25,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-20 05:30:25,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997276960] [2024-11-20 05:30:25,331 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-20 05:30:25,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 05:30:25,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:30:25,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 05:30:25,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-20 05:30:25,332 INFO L87 Difference]: Start difference. First operand 662 states and 925 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-20 05:30:25,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:30:25,848 INFO L93 Difference]: Finished difference Result 1118 states and 1550 transitions. [2024-11-20 05:30:25,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 05:30:25,848 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 192 [2024-11-20 05:30:25,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:30:25,853 INFO L225 Difference]: With dead ends: 1118 [2024-11-20 05:30:25,853 INFO L226 Difference]: Without dead ends: 931 [2024-11-20 05:30:25,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-20 05:30:25,854 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 131 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 05:30:25,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 537 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 05:30:25,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2024-11-20 05:30:25,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 662. [2024-11-20 05:30:25,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 426 states have (on average 1.2183098591549295) internal successors, (519), 426 states have internal predecessors, (519), 203 states have call successors, (203), 32 states have call predecessors, (203), 32 states have return successors, (203), 203 states have call predecessors, (203), 203 states have call successors, (203) [2024-11-20 05:30:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 925 transitions. [2024-11-20 05:30:25,915 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 925 transitions. Word has length 192 [2024-11-20 05:30:25,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:30:25,916 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 925 transitions. [2024-11-20 05:30:25,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-20 05:30:25,916 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 925 transitions. [2024-11-20 05:30:25,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-20 05:30:25,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:30:25,918 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, 1, 1, 1, 1, 1, 1] [2024-11-20 05:30:25,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 05:30:26,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:30:26,118 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:30:26,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:30:26,119 INFO L85 PathProgramCache]: Analyzing trace with hash 818970720, now seen corresponding path program 1 times [2024-11-20 05:30:26,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:30:26,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767464757] [2024-11-20 05:30:26,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:26,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:30:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 05:30:26,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [177737625] [2024-11-20 05:30:26,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:26,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:30:26,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:30:26,184 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 05:30:26,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 05:30:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:30:26,284 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 05:30:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:30:26,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 05:30:26,414 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 05:30:26,414 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 05:30:26,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-20 05:30:26,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-20 05:30:26,619 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:30:26,723 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 05:30:26,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:30:26 BoogieIcfgContainer [2024-11-20 05:30:26,725 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 05:30:26,726 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 05:30:26,726 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 05:30:26,726 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 05:30:26,726 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:30:13" (3/4) ... [2024-11-20 05:30:26,728 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 05:30:26,728 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 05:30:26,729 INFO L158 Benchmark]: Toolchain (without parser) took 14474.11ms. Allocated memory was 174.1MB in the beginning and 352.3MB in the end (delta: 178.3MB). Free memory was 125.7MB in the beginning and 239.7MB in the end (delta: -114.0MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. [2024-11-20 05:30:26,729 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 174.1MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:30:26,729 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.03ms. Allocated memory is still 174.1MB. Free memory was 125.7MB in the beginning and 108.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 05:30:26,729 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.02ms. Allocated memory is still 174.1MB. Free memory was 108.1MB in the beginning and 104.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 05:30:26,730 INFO L158 Benchmark]: Boogie Preprocessor took 76.69ms. Allocated memory is still 174.1MB. Free memory was 104.0MB in the beginning and 97.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 05:30:26,730 INFO L158 Benchmark]: RCFGBuilder took 477.44ms. Allocated memory is still 174.1MB. Free memory was 97.0MB in the beginning and 68.3MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-20 05:30:26,730 INFO L158 Benchmark]: TraceAbstraction took 13597.23ms. Allocated memory was 174.1MB in the beginning and 352.3MB in the end (delta: 178.3MB). Free memory was 67.7MB in the beginning and 239.7MB in the end (delta: -172.0MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2024-11-20 05:30:26,730 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 352.3MB. Free memory is still 239.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:30:26,732 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.10ms. Allocated memory is still 174.1MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.03ms. Allocated memory is still 174.1MB. Free memory was 125.7MB in the beginning and 108.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.02ms. Allocated memory is still 174.1MB. Free memory was 108.1MB in the beginning and 104.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.69ms. Allocated memory is still 174.1MB. Free memory was 104.0MB in the beginning and 97.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 477.44ms. Allocated memory is still 174.1MB. Free memory was 97.0MB in the beginning and 68.3MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13597.23ms. Allocated memory was 174.1MB in the beginning and 352.3MB in the end (delta: 178.3MB). Free memory was 67.7MB in the beginning and 239.7MB in the end (delta: -172.0MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 352.3MB. Free memory is still 239.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 200, overapproximation of someUnaryDOUBLEoperation at line 30, overapproximation of someBinaryArithmeticFLOAToperation at line 65. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 0; [L37] unsigned char var_1_25 = 1; [L38] float var_1_26 = 500.65; [L39] signed long int var_1_27 = -8; [L40] float var_1_28 = 255.5; [L41] float var_1_29 = 7.5; [L42] float var_1_30 = 9.8; [L43] unsigned char var_1_31 = 4; [L44] unsigned char var_1_33 = 2; [L45] unsigned short int var_1_34 = 1; [L46] unsigned long int var_1_35 = 10; [L47] unsigned char var_1_36 = 10; [L48] unsigned char var_1_37 = 128; [L49] unsigned char var_1_38 = 16; [L50] unsigned char var_1_39 = 0; [L51] unsigned short int var_1_40 = 10; [L52] unsigned short int var_1_41 = 128; [L53] unsigned short int var_1_42 = 40597; [L54] signed short int last_1_var_1_1 = 16; [L55] unsigned char last_1_var_1_6 = 10; [L56] unsigned char last_1_var_1_8 = 1; [L57] signed short int last_1_var_1_13 = 200; VAL [isInitial=0, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L204] isInitial = 1 [L205] FCALL initially() [L206] COND TRUE 1 [L207] CALL updateLastVariables() [L194] last_1_var_1_1 = var_1_1 [L195] last_1_var_1_6 = var_1_6 [L196] last_1_var_1_8 = var_1_8 [L197] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L207] RET updateLastVariables() [L208] CALL updateVariables() [L147] var_1_5 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L148] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L149] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L149] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L150] var_1_7 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L151] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L152] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L153] var_1_11 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L154] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L155] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L155] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L156] var_1_12 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L157] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L158] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L158] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L159] var_1_15 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L160] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L161] var_1_16 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L162] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L163] var_1_20 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L164] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L165] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L165] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L166] var_1_25 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_25 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L167] RET assume_abort_if_not(var_1_25 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L168] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L168] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L169] var_1_27 = __VERIFIER_nondet_long() [L170] CALL assume_abort_if_not(var_1_27 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L170] RET assume_abort_if_not(var_1_27 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L171] CALL assume_abort_if_not(var_1_27 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L171] RET assume_abort_if_not(var_1_27 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L172] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L172] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L173] var_1_28 = __VERIFIER_nondet_float() [L174] CALL assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L174] RET assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L175] var_1_29 = __VERIFIER_nondet_float() [L176] CALL assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L176] RET assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L177] var_1_33 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L178] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L179] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L179] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L180] var_1_37 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_37 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L181] RET assume_abort_if_not(var_1_37 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L182] CALL assume_abort_if_not(var_1_37 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L182] RET assume_abort_if_not(var_1_37 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L183] var_1_38 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L184] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L185] CALL assume_abort_if_not(var_1_38 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L185] RET assume_abort_if_not(var_1_38 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L186] var_1_39 = __VERIFIER_nondet_uchar() [L187] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L187] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L188] CALL assume_abort_if_not(var_1_39 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L188] RET assume_abort_if_not(var_1_39 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L189] var_1_42 = __VERIFIER_nondet_ushort() [L190] CALL assume_abort_if_not(var_1_42 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L190] RET assume_abort_if_not(var_1_42 >= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L191] CALL assume_abort_if_not(var_1_42 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L191] RET assume_abort_if_not(var_1_42 <= 65534) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L208] RET updateVariables() [L209] CALL step() [L61] COND TRUE var_1_19 || var_1_8 [L62] var_1_21 = ((var_1_13 > -4) || var_1_25) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_26=10013/20, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L64] COND TRUE ((var_1_13 + 25) % var_1_27) < 2 [L65] var_1_26 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) + var_1_29) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L67] COND TRUE (- var_1_28) < ((((var_1_14) > (var_1_29)) ? (var_1_14) : (var_1_29))) [L68] var_1_30 = var_1_29 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L70] COND TRUE ((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) < (var_1_13)) ? (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) : (var_1_13))) <= var_1_13 [L71] var_1_31 = var_1_33 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L73] COND FALSE !(var_1_6 < ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L76] COND TRUE \read(var_1_25) [L77] var_1_35 = var_1_33 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L79] COND TRUE \read(var_1_25) [L80] var_1_36 = (var_1_37 - var_1_38) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L84] COND TRUE (- var_1_17) != var_1_17 [L85] var_1_40 = var_1_39 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L87] COND FALSE !(var_1_33 <= (~ var_1_13)) [L92] var_1_41 = var_1_1 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L94] signed long int stepLocal_6 = last_1_var_1_1; [L95] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=0, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L96] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L97] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L100] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L105] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L108] COND FALSE !(var_1_5 >= -2) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L111] unsigned char stepLocal_4 = var_1_6; [L112] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=10, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L113] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=10, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L114] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L115] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L122] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=10, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L123] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L126] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=10, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L127] COND TRUE \read(var_1_19) [L128] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=10, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L134] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L135] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=10, stepLocal_1=201, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L136] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L143] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=10, stepLocal_1=201, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=0] [L209] RET step() [L210] CALL, EXPR property() [L200-L201] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=0] [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 10, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1677 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1634 mSDsluCounter, 4650 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3423 mSDsCounter, 795 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2599 IncrementalHoareTripleChecker+Invalid, 3394 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 795 mSolverCounterUnsat, 1227 mSDtfsCounter, 2599 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1927 GetRequests, 1767 SyntacticMatches, 2 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=662occurred in iteration=8, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 1032 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 2879 NumberOfCodeBlocks, 2879 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2480 ConstructedInterpolants, 2 QuantifiedInterpolants, 11013 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1814 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 20476/21112 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 05:30:26,769 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_fillercodestructure_filler-ps-co_file-42.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 f02b4d764a6f2b9378677160d85f84fe71fe9bb12a30ec7a53966c7051db5504 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:30:28,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:30:28,630 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 05:30:28,635 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:30:28,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:30:28,660 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:30:28,662 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:30:28,663 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:30:28,663 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:30:28,664 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:30:28,664 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:30:28,664 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:30:28,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:30:28,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:30:28,666 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:30:28,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:30:28,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:30:28,667 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:30:28,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:30:28,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:30:28,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:30:28,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:30:28,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:30:28,670 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 05:30:28,670 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 05:30:28,670 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:30:28,670 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 05:30:28,670 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:30:28,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:30:28,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:30:28,671 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:30:28,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:30:28,671 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:30:28,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:30:28,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:30:28,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:30:28,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:30:28,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:30:28,681 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 05:30:28,681 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 05:30:28,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:30:28,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:30:28,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:30:28,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:30:28,683 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 -> f02b4d764a6f2b9378677160d85f84fe71fe9bb12a30ec7a53966c7051db5504 [2024-11-20 05:30:28,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:30:28,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:30:28,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:30:28,940 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:30:28,940 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:30:28,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i [2024-11-20 05:30:30,169 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:30:30,358 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:30:30,359 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i [2024-11-20 05:30:30,373 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6685853e/851ae0258e924273943eea9c6cb4528f/FLAG508c4c29e [2024-11-20 05:30:30,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6685853e/851ae0258e924273943eea9c6cb4528f [2024-11-20 05:30:30,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:30:30,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:30:30,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:30:30,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:30:30,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:30:30,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:30:30" (1/1) ... [2024-11-20 05:30:30,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7443d505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:30, skipping insertion in model container [2024-11-20 05:30:30,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:30:30" (1/1) ... [2024-11-20 05:30:30,426 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:30:30,561 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i[919,932] [2024-11-20 05:30:30,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:30:30,649 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:30:30,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i[919,932] [2024-11-20 05:30:30,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:30:30,725 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:30:30,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:30 WrapperNode [2024-11-20 05:30:30,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:30:30,729 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:30:30,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:30:30,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:30:30,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:30" (1/1) ... [2024-11-20 05:30:30,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:30" (1/1) ... [2024-11-20 05:30:30,771 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2024-11-20 05:30:30,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:30:30,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:30:30,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:30:30,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:30:30,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:30" (1/1) ... [2024-11-20 05:30:30,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:30" (1/1) ... [2024-11-20 05:30:30,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:30" (1/1) ... [2024-11-20 05:30:30,809 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 05:30:30,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:30" (1/1) ... [2024-11-20 05:30:30,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:30" (1/1) ... [2024-11-20 05:30:30,824 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:30" (1/1) ... [2024-11-20 05:30:30,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:30" (1/1) ... [2024-11-20 05:30:30,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:30" (1/1) ... [2024-11-20 05:30:30,839 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:30" (1/1) ... [2024-11-20 05:30:30,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:30:30,846 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:30:30,846 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:30:30,846 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:30:30,847 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:30" (1/1) ... [2024-11-20 05:30:30,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:30:30,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:30:30,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 05:30:30,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 05:30:30,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:30:30,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 05:30:30,920 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:30:30,920 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:30:30,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:30:30,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:30:31,016 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:30:31,020 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:30:31,581 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-20 05:30:31,581 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:30:31,591 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:30:31,591 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:30:31,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:30:31 BoogieIcfgContainer [2024-11-20 05:30:31,591 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:30:31,593 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:30:31,593 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:30:31,595 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:30:31,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:30:30" (1/3) ... [2024-11-20 05:30:31,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed652b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:30:31, skipping insertion in model container [2024-11-20 05:30:31,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:30:30" (2/3) ... [2024-11-20 05:30:31,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed652b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:30:31, skipping insertion in model container [2024-11-20 05:30:31,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:30:31" (3/3) ... [2024-11-20 05:30:31,596 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i [2024-11-20 05:30:31,608 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:30:31,608 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:30:31,664 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:30:31,671 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;@40c695eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:30:31,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:30:31,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 59 states have internal predecessors, (84), 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-11-20 05:30:31,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 05:30:31,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:30:31,690 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, 1, 1, 1, 1] [2024-11-20 05:30:31,690 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:30:31,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:30:31,695 INFO L85 PathProgramCache]: Analyzing trace with hash -780663087, now seen corresponding path program 1 times [2024-11-20 05:30:31,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:30:31,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567897918] [2024-11-20 05:30:31,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:31,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:30:31,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:30:31,710 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:30:31,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 05:30:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:32,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 05:30:32,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:30:32,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2024-11-20 05:30:32,120 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:30:32,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:30:32,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567897918] [2024-11-20 05:30:32,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567897918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:30:32,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:30:32,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:30:32,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224949548] [2024-11-20 05:30:32,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:30:32,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:30:32,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:30:32,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:30:32,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:30:32,149 INFO L87 Difference]: Start difference. First operand has 90 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 59 states have internal predecessors, (84), 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 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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-11-20 05:30:32,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:30:32,179 INFO L93 Difference]: Finished difference Result 173 states and 307 transitions. [2024-11-20 05:30:32,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:30:32,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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 191 [2024-11-20 05:30:32,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:30:32,187 INFO L225 Difference]: With dead ends: 173 [2024-11-20 05:30:32,187 INFO L226 Difference]: Without dead ends: 86 [2024-11-20 05:30:32,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:30:32,194 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:30:32,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:30:32,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-20 05:30:32,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-20 05:30:32,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 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-11-20 05:30:32,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 133 transitions. [2024-11-20 05:30:32,238 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 133 transitions. Word has length 191 [2024-11-20 05:30:32,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:30:32,238 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 133 transitions. [2024-11-20 05:30:32,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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-11-20 05:30:32,239 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 133 transitions. [2024-11-20 05:30:32,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 05:30:32,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:30:32,242 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, 1, 1, 1, 1] [2024-11-20 05:30:32,253 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-11-20 05:30:32,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:30:32,443 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:30:32,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:30:32,444 INFO L85 PathProgramCache]: Analyzing trace with hash -286786807, now seen corresponding path program 1 times [2024-11-20 05:30:32,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:30:32,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013483856] [2024-11-20 05:30:32,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:32,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:30:32,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:30:32,448 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:30:32,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 05:30:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:32,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 05:30:32,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:30:32,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 820 proven. 48 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2024-11-20 05:30:32,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:30:33,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 36 proven. 48 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-20 05:30:33,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:30:33,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013483856] [2024-11-20 05:30:33,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013483856] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 05:30:33,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 05:30:33,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-20 05:30:33,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963328245] [2024-11-20 05:30:33,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 05:30:33,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 05:30:33,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:30:33,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 05:30:33,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 05:30:33,184 INFO L87 Difference]: Start difference. First operand 86 states and 133 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-20 05:30:33,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:30:33,459 INFO L93 Difference]: Finished difference Result 175 states and 268 transitions. [2024-11-20 05:30:33,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 05:30:33,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 191 [2024-11-20 05:30:33,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:30:33,462 INFO L225 Difference]: With dead ends: 175 [2024-11-20 05:30:33,462 INFO L226 Difference]: Without dead ends: 92 [2024-11-20 05:30:33,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 374 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-20 05:30:33,464 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 67 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:30:33,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 234 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:30:33,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-20 05:30:33,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2024-11-20 05:30:33,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 58 states have internal predecessors, (76), 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-11-20 05:30:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 134 transitions. [2024-11-20 05:30:33,480 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 134 transitions. Word has length 191 [2024-11-20 05:30:33,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:30:33,483 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 134 transitions. [2024-11-20 05:30:33,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-20 05:30:33,484 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 134 transitions. [2024-11-20 05:30:33,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 05:30:33,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:30:33,487 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, 1, 1, 1, 1] [2024-11-20 05:30:33,498 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-11-20 05:30:33,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:30:33,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:30:33,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:30:33,690 INFO L85 PathProgramCache]: Analyzing trace with hash 530861643, now seen corresponding path program 1 times [2024-11-20 05:30:33,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:30:33,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995313015] [2024-11-20 05:30:33,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:33,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:30:33,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:30:33,693 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:30:33,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 05:30:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:33,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 05:30:33,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:30:34,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 05:30:34,236 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:30:34,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:30:34,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995313015] [2024-11-20 05:30:34,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995313015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:30:34,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:30:34,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:30:34,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393944697] [2024-11-20 05:30:34,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:30:34,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:30:34,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:30:34,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:30:34,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:30:34,242 INFO L87 Difference]: Start difference. First operand 90 states and 134 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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-11-20 05:30:34,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:30:34,511 INFO L93 Difference]: Finished difference Result 265 states and 397 transitions. [2024-11-20 05:30:34,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:30:34,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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 191 [2024-11-20 05:30:34,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:30:34,517 INFO L225 Difference]: With dead ends: 265 [2024-11-20 05:30:34,518 INFO L226 Difference]: Without dead ends: 178 [2024-11-20 05:30:34,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 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-11-20 05:30:34,519 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 98 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:30:34,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 372 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:30:34,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-20 05:30:34,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 157. [2024-11-20 05:30:34,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 94 states have (on average 1.2446808510638299) internal successors, (117), 94 states have internal predecessors, (117), 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-11-20 05:30:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 233 transitions. [2024-11-20 05:30:34,562 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 233 transitions. Word has length 191 [2024-11-20 05:30:34,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:30:34,563 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 233 transitions. [2024-11-20 05:30:34,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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-11-20 05:30:34,566 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 233 transitions. [2024-11-20 05:30:34,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 05:30:34,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:30:34,570 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, 1, 1, 1, 1, 1] [2024-11-20 05:30:34,593 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 (4)] Ended with exit code 0 [2024-11-20 05:30:34,771 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-11-20 05:30:34,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:30:34,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:30:34,772 INFO L85 PathProgramCache]: Analyzing trace with hash -525084499, now seen corresponding path program 1 times [2024-11-20 05:30:34,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:30:34,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564938795] [2024-11-20 05:30:34,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:34,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:30:34,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:30:34,775 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-11-20 05:30:34,776 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-11-20 05:30:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:35,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 05:30:35,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:30:35,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 05:30:35,633 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:30:35,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:30:35,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564938795] [2024-11-20 05:30:35,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564938795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:30:35,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:30:35,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:30:35,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765324256] [2024-11-20 05:30:35,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:30:35,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 05:30:35,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:30:35,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 05:30:35,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:30:35,636 INFO L87 Difference]: Start difference. First operand 157 states and 233 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 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-11-20 05:30:36,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:30:36,205 INFO L93 Difference]: Finished difference Result 375 states and 562 transitions. [2024-11-20 05:30:36,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 05:30:36,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 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 192 [2024-11-20 05:30:36,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:30:36,214 INFO L225 Difference]: With dead ends: 375 [2024-11-20 05:30:36,214 INFO L226 Difference]: Without dead ends: 288 [2024-11-20 05:30:36,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 05:30:36,215 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 156 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 05:30:36,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 456 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 05:30:36,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-20 05:30:36,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 242. [2024-11-20 05:30:36,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 148 states have (on average 1.2702702702702702) internal successors, (188), 148 states have internal predecessors, (188), 87 states have call successors, (87), 6 states have call predecessors, (87), 6 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-20 05:30:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 362 transitions. [2024-11-20 05:30:36,255 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 362 transitions. Word has length 192 [2024-11-20 05:30:36,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:30:36,256 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 362 transitions. [2024-11-20 05:30:36,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 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-11-20 05:30:36,256 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 362 transitions. [2024-11-20 05:30:36,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 05:30:36,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:30:36,258 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, 1, 1, 1, 1, 1] [2024-11-20 05:30:36,269 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-11-20 05:30:36,458 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-11-20 05:30:36,458 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:30:36,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:30:36,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1804948177, now seen corresponding path program 1 times [2024-11-20 05:30:36,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:30:36,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481934911] [2024-11-20 05:30:36,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:36,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:30:36,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:30:36,462 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-11-20 05:30:36,463 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-11-20 05:30:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:36,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 05:30:36,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:30:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 05:30:36,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:30:36,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:30:36,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481934911] [2024-11-20 05:30:36,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481934911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:30:36,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:30:36,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:30:36,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342421817] [2024-11-20 05:30:36,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:30:36,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:30:36,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:30:36,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:30:36,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:30:36,728 INFO L87 Difference]: Start difference. First operand 242 states and 362 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-11-20 05:30:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:30:36,849 INFO L93 Difference]: Finished difference Result 414 states and 622 transitions. [2024-11-20 05:30:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:30:36,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 192 [2024-11-20 05:30:36,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:30:36,856 INFO L225 Difference]: With dead ends: 414 [2024-11-20 05:30:36,856 INFO L226 Difference]: Without dead ends: 242 [2024-11-20 05:30:36,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:30:36,859 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:30:36,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:30:36,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-20 05:30:36,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2024-11-20 05:30:36,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 148 states have (on average 1.2567567567567568) internal successors, (186), 148 states have internal predecessors, (186), 87 states have call successors, (87), 6 states have call predecessors, (87), 6 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-20 05:30:36,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 360 transitions. [2024-11-20 05:30:36,889 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 360 transitions. Word has length 192 [2024-11-20 05:30:36,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:30:36,889 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 360 transitions. [2024-11-20 05:30:36,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-11-20 05:30:36,891 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 360 transitions. [2024-11-20 05:30:36,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 05:30:36,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:30:36,893 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, 1, 1, 1, 1, 1] [2024-11-20 05:30:36,904 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 (6)] Ended with exit code 0 [2024-11-20 05:30:37,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:30:37,094 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:30:37,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:30:37,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1124889807, now seen corresponding path program 1 times [2024-11-20 05:30:37,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:30:37,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409291592] [2024-11-20 05:30:37,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:37,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:30:37,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:30:37,096 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:30:37,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 05:30:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:37,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 05:30:37,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:30:37,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 863 proven. 111 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-11-20 05:30:37,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:30:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 51 proven. 114 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2024-11-20 05:30:38,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:30:38,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409291592] [2024-11-20 05:30:38,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409291592] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 05:30:38,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 05:30:38,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-20 05:30:38,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721139349] [2024-11-20 05:30:38,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 05:30:38,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 05:30:38,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:30:38,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 05:30:38,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-20 05:30:38,103 INFO L87 Difference]: Start difference. First operand 242 states and 360 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (50), 3 states have call predecessors, (50), 7 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-11-20 05:30:38,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:30:38,914 INFO L93 Difference]: Finished difference Result 481 states and 681 transitions. [2024-11-20 05:30:38,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-20 05:30:38,915 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (50), 3 states have call predecessors, (50), 7 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 192 [2024-11-20 05:30:38,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:30:38,917 INFO L225 Difference]: With dead ends: 481 [2024-11-20 05:30:38,917 INFO L226 Difference]: Without dead ends: 394 [2024-11-20 05:30:38,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 372 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-11-20 05:30:38,918 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 296 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 05:30:38,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 482 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 05:30:38,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-20 05:30:38,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 368. [2024-11-20 05:30:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 235 states have (on average 1.2425531914893617) internal successors, (292), 235 states have internal predecessors, (292), 116 states have call successors, (116), 16 states have call predecessors, (116), 16 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-20 05:30:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 524 transitions. [2024-11-20 05:30:38,957 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 524 transitions. Word has length 192 [2024-11-20 05:30:38,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:30:38,958 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 524 transitions. [2024-11-20 05:30:38,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (50), 3 states have call predecessors, (50), 7 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-11-20 05:30:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 524 transitions. [2024-11-20 05:30:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 05:30:38,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:30:38,960 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, 1, 1, 1, 1, 1] [2024-11-20 05:30:38,970 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 (7)] Ended with exit code 0 [2024-11-20 05:30:39,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:30:39,161 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:30:39,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:30:39,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2136007057, now seen corresponding path program 1 times [2024-11-20 05:30:39,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:30:39,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743152478] [2024-11-20 05:30:39,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:39,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:30:39,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:30:39,163 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:30:39,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-20 05:30:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:39,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 05:30:39,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:30:39,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-20 05:30:39,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:30:40,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:30:40,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743152478] [2024-11-20 05:30:40,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743152478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 05:30:40,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [534907087] [2024-11-20 05:30:40,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:40,356 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 05:30:40,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 05:30:40,358 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 05:30:40,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-20 05:30:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:40,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 05:30:40,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:30:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 05:30:41,694 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:30:41,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [534907087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:30:41,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 05:30:41,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-20 05:30:41,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410704740] [2024-11-20 05:30:41,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:30:41,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 05:30:41,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:30:41,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 05:30:41,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-20 05:30:41,696 INFO L87 Difference]: Start difference. First operand 368 states and 524 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 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-11-20 05:30:43,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:30:43,364 INFO L93 Difference]: Finished difference Result 981 states and 1393 transitions. [2024-11-20 05:30:43,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 05:30:43,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 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 192 [2024-11-20 05:30:43,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:30:43,370 INFO L225 Difference]: With dead ends: 981 [2024-11-20 05:30:43,370 INFO L226 Difference]: Without dead ends: 688 [2024-11-20 05:30:43,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-20 05:30:43,372 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 93 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 05:30:43,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 462 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 05:30:43,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-11-20 05:30:43,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 646. [2024-11-20 05:30:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 414 states have (on average 1.2246376811594204) internal successors, (507), 414 states have internal predecessors, (507), 203 states have call successors, (203), 28 states have call predecessors, (203), 28 states have return successors, (203), 203 states have call predecessors, (203), 203 states have call successors, (203) [2024-11-20 05:30:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 913 transitions. [2024-11-20 05:30:43,426 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 913 transitions. Word has length 192 [2024-11-20 05:30:43,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:30:43,426 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 913 transitions. [2024-11-20 05:30:43,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 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-11-20 05:30:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 913 transitions. [2024-11-20 05:30:43,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 05:30:43,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:30:43,429 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, 1, 1, 1, 1, 1] [2024-11-20 05:30:43,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2024-11-20 05:30:43,647 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 (8)] Ended with exit code 0 [2024-11-20 05:30:43,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:30:43,831 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:30:43,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:30:43,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1549201043, now seen corresponding path program 1 times [2024-11-20 05:30:43,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:30:43,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156127736] [2024-11-20 05:30:43,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:43,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:30:43,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:30:43,834 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:30:43,835 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 (10)] Waiting until timeout for monitored process [2024-11-20 05:30:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:44,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 05:30:44,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:30:44,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-11-20 05:30:44,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:30:44,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:30:44,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156127736] [2024-11-20 05:30:44,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156127736] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 05:30:44,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [310964124] [2024-11-20 05:30:44,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:44,959 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 05:30:44,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 05:30:44,960 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 05:30:44,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-20 05:30:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:45,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 05:30:45,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:30:45,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-20 05:30:45,914 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:30:45,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [310964124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:30:45,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 05:30:45,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-20 05:30:45,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99967157] [2024-11-20 05:30:45,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:30:45,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 05:30:45,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:30:45,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 05:30:45,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-20 05:30:45,915 INFO L87 Difference]: Start difference. First operand 646 states and 913 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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-11-20 05:30:47,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:30:47,800 INFO L93 Difference]: Finished difference Result 1134 states and 1592 transitions. [2024-11-20 05:30:47,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 05:30:47,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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 192 [2024-11-20 05:30:47,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:30:47,808 INFO L225 Difference]: With dead ends: 1134 [2024-11-20 05:30:47,808 INFO L226 Difference]: Without dead ends: 947 [2024-11-20 05:30:47,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-20 05:30:47,811 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 122 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 05:30:47,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 568 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 05:30:47,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2024-11-20 05:30:47,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 874. [2024-11-20 05:30:47,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 570 states have (on average 1.2298245614035088) internal successors, (701), 572 states have internal predecessors, (701), 265 states have call successors, (265), 38 states have call predecessors, (265), 38 states have return successors, (265), 263 states have call predecessors, (265), 265 states have call successors, (265) [2024-11-20 05:30:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1231 transitions. [2024-11-20 05:30:47,883 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1231 transitions. Word has length 192 [2024-11-20 05:30:47,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:30:47,886 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1231 transitions. [2024-11-20 05:30:47,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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-11-20 05:30:47,886 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1231 transitions. [2024-11-20 05:30:47,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-20 05:30:47,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:30:47,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, 1, 1, 1, 1, 1, 1] [2024-11-20 05:30:47,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-20 05:30:48,101 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 (10)] Forceful destruction successful, exit code 0 [2024-11-20 05:30:48,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:30:48,290 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:30:48,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:30:48,290 INFO L85 PathProgramCache]: Analyzing trace with hash 818970720, now seen corresponding path program 1 times [2024-11-20 05:30:48,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:30:48,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773366436] [2024-11-20 05:30:48,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:30:48,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:30:48,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:30:48,292 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:30:48,292 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 (12)] Waiting until timeout for monitored process [2024-11-20 05:30:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:30:48,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-20 05:30:48,519 INFO L278 TraceCheckSpWp]: Computing forward predicates...