./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-pe-co_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-97.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3365a81206d364d6796ce2111e3130ddc986e1964f44a787bf6a1f0911048837 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:05:14,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:05:14,393 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:05:14,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:05:14,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:05:14,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:05:14,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:05:14,425 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:05:14,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:05:14,426 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:05:14,426 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:05:14,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:05:14,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:05:14,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:05:14,428 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:05:14,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:05:14,429 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:05:14,429 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:05:14,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:05:14,430 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:05:14,430 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:05:14,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:05:14,431 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:05:14,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:05:14,432 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:05:14,432 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:05:14,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:05:14,433 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:05:14,433 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:05:14,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:05:14,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:05:14,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:05:14,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:05:14,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:05:14,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:05:14,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:05:14,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:05:14,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:05:14,436 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:05:14,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:05:14,437 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:05:14,437 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:05:14,437 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 -> 3365a81206d364d6796ce2111e3130ddc986e1964f44a787bf6a1f0911048837 [2024-10-13 02:05:14,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:05:14,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:05:14,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:05:14,735 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:05:14,735 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:05:14,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-97.i [2024-10-13 02:05:16,192 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:05:16,397 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:05:16,397 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-97.i [2024-10-13 02:05:16,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0324bc8f6/cee7f15ea4c34ad586918a3e04576b52/FLAG65da5d3e0 [2024-10-13 02:05:16,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0324bc8f6/cee7f15ea4c34ad586918a3e04576b52 [2024-10-13 02:05:16,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:05:16,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:05:16,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:05:16,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:05:16,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:05:16,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:05:16" (1/1) ... [2024-10-13 02:05:16,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10f70fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:16, skipping insertion in model container [2024-10-13 02:05:16,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:05:16" (1/1) ... [2024-10-13 02:05:16,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:05:17,061 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-97.i[919,932] [2024-10-13 02:05:17,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:05:17,182 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:05:17,192 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-97.i[919,932] [2024-10-13 02:05:17,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:05:17,259 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:05:17,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:17 WrapperNode [2024-10-13 02:05:17,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:05:17,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:05:17,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:05:17,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:05:17,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:17" (1/1) ... [2024-10-13 02:05:17,281 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:17" (1/1) ... [2024-10-13 02:05:17,336 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 296 [2024-10-13 02:05:17,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:05:17,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:05:17,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:05:17,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:05:17,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:17" (1/1) ... [2024-10-13 02:05:17,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:17" (1/1) ... [2024-10-13 02:05:17,358 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:17" (1/1) ... [2024-10-13 02:05:17,386 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:05:17,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:17" (1/1) ... [2024-10-13 02:05:17,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:17" (1/1) ... [2024-10-13 02:05:17,404 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:17" (1/1) ... [2024-10-13 02:05:17,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:17" (1/1) ... [2024-10-13 02:05:17,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:17" (1/1) ... [2024-10-13 02:05:17,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:17" (1/1) ... [2024-10-13 02:05:17,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:05:17,425 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:05:17,425 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:05:17,425 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:05:17,426 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:17" (1/1) ... [2024-10-13 02:05:17,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:05:17,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:05:17,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:05:17,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:05:17,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:05:17,513 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:05:17,515 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:05:17,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:05:17,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:05:17,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:05:17,606 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:05:17,608 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:05:18,150 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-13 02:05:18,151 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:05:18,184 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:05:18,184 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:05:18,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:05:18 BoogieIcfgContainer [2024-10-13 02:05:18,185 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:05:18,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:05:18,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:05:18,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:05:18,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:05:16" (1/3) ... [2024-10-13 02:05:18,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c118910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:05:18, skipping insertion in model container [2024-10-13 02:05:18,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:17" (2/3) ... [2024-10-13 02:05:18,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c118910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:05:18, skipping insertion in model container [2024-10-13 02:05:18,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:05:18" (3/3) ... [2024-10-13 02:05:18,196 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-97.i [2024-10-13 02:05:18,210 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:05:18,210 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:05:18,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:05:18,277 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;@6b6e8630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:05:18,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:05:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 84 states have (on average 1.5119047619047619) internal successors, (127), 85 states have internal predecessors, (127), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 02:05:18,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-13 02:05:18,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:05:18,296 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:05:18,297 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:05:18,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:05:18,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1770873557, now seen corresponding path program 1 times [2024-10-13 02:05:18,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:05:18,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83228193] [2024-10-13 02:05:18,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:05:18,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:05:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:05:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:05:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:05:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:05:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:05:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:05:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:05:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:05:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:05:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:05:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:05:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:05:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:05:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:05:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:05:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:05:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:05:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:05:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:05:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:05:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:05:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:05:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:05:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:05:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 02:05:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:05:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:05:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:05:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:05:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 02:05:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 02:05:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 02:05:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-13 02:05:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:18,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:05:18,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:05:18,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83228193] [2024-10-13 02:05:18,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83228193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:05:18,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:05:18,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:05:18,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750473382] [2024-10-13 02:05:18,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:05:18,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:05:18,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:05:19,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:05:19,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:05:19,027 INFO L87 Difference]: Start difference. First operand has 120 states, 84 states have (on average 1.5119047619047619) internal successors, (127), 85 states have internal predecessors, (127), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 02:05:19,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:05:19,081 INFO L93 Difference]: Finished difference Result 236 states and 416 transitions. [2024-10-13 02:05:19,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:05:19,086 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 208 [2024-10-13 02:05:19,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:05:19,093 INFO L225 Difference]: With dead ends: 236 [2024-10-13 02:05:19,093 INFO L226 Difference]: Without dead ends: 117 [2024-10-13 02:05:19,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:05:19,102 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:05:19,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:05:19,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-13 02:05:19,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-13 02:05:19,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 82 states have internal predecessors, (118), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 02:05:19,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 184 transitions. [2024-10-13 02:05:19,153 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 184 transitions. Word has length 208 [2024-10-13 02:05:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:05:19,154 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 184 transitions. [2024-10-13 02:05:19,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 02:05:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 184 transitions. [2024-10-13 02:05:19,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-13 02:05:19,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:05:19,159 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:05:19,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:05:19,160 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:05:19,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:05:19,161 INFO L85 PathProgramCache]: Analyzing trace with hash 628825927, now seen corresponding path program 1 times [2024-10-13 02:05:19,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:05:19,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133669143] [2024-10-13 02:05:19,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:05:19,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:05:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:05:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:05:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:05:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:05:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:05:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:05:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:05:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:05:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:05:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:05:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:05:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:05:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:05:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:05:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:05:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:05:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:05:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:05:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:05:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:05:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:05:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:05:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:05:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:05:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 02:05:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:05:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:05:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:05:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:05:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 02:05:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 02:05:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 02:05:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-13 02:05:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:19,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:05:19,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:05:19,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133669143] [2024-10-13 02:05:19,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133669143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:05:19,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:05:19,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:05:19,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204927875] [2024-10-13 02:05:19,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:05:19,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:05:19,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:05:19,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:05:19,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:05:19,607 INFO L87 Difference]: Start difference. First operand 117 states and 184 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:05:19,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:05:19,727 INFO L93 Difference]: Finished difference Result 334 states and 525 transitions. [2024-10-13 02:05:19,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:05:19,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2024-10-13 02:05:19,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:05:19,736 INFO L225 Difference]: With dead ends: 334 [2024-10-13 02:05:19,736 INFO L226 Difference]: Without dead ends: 218 [2024-10-13 02:05:19,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:05:19,738 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 143 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:05:19,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 333 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:05:19,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-13 02:05:19,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 153. [2024-10-13 02:05:19,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 118 states have internal predecessors, (172), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 02:05:19,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 238 transitions. [2024-10-13 02:05:19,759 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 238 transitions. Word has length 208 [2024-10-13 02:05:19,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:05:19,762 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 238 transitions. [2024-10-13 02:05:19,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:05:19,763 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 238 transitions. [2024-10-13 02:05:19,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-13 02:05:19,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:05:19,766 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:05:19,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:05:19,767 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:05:19,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:05:19,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1329890505, now seen corresponding path program 1 times [2024-10-13 02:05:19,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:05:19,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839473396] [2024-10-13 02:05:19,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:05:19,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:05:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:05:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:05:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:05:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:05:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:05:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:05:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:05:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:05:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:05:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:05:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:05:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:05:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:05:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:05:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:05:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:05:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:05:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:05:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:05:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:05:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:05:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:05:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:05:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:05:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 02:05:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:05:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:05:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:05:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:05:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 02:05:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 02:05:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 02:05:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-13 02:05:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:20,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:05:20,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:05:20,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839473396] [2024-10-13 02:05:20,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839473396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:05:20,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:05:20,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:05:20,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506525242] [2024-10-13 02:05:20,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:05:20,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:05:20,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:05:20,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:05:20,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:05:20,401 INFO L87 Difference]: Start difference. First operand 153 states and 238 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:05:20,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:05:20,877 INFO L93 Difference]: Finished difference Result 466 states and 721 transitions. [2024-10-13 02:05:20,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:05:20,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2024-10-13 02:05:20,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:05:20,882 INFO L225 Difference]: With dead ends: 466 [2024-10-13 02:05:20,882 INFO L226 Difference]: Without dead ends: 314 [2024-10-13 02:05:20,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:05:20,884 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 184 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 02:05:20,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 683 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 02:05:20,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-10-13 02:05:20,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 253. [2024-10-13 02:05:20,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 184 states have (on average 1.3967391304347827) internal successors, (257), 184 states have internal predecessors, (257), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 02:05:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 389 transitions. [2024-10-13 02:05:20,934 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 389 transitions. Word has length 208 [2024-10-13 02:05:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:05:20,937 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 389 transitions. [2024-10-13 02:05:20,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:05:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 389 transitions. [2024-10-13 02:05:20,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-13 02:05:20,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:05:20,942 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:05:20,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:05:20,942 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:05:20,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:05:20,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2147428341, now seen corresponding path program 1 times [2024-10-13 02:05:20,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:05:20,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080802343] [2024-10-13 02:05:20,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:05:20,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:05:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:05:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:05:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:05:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:05:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:05:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:05:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:05:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:05:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:05:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:05:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:05:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:05:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:05:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:05:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:05:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:05:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:05:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:05:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:05:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:05:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:05:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:05:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:05:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:05:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 02:05:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:05:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:05:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:05:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:05:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 02:05:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 02:05:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 02:05:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-13 02:05:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:05:21,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:05:21,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080802343] [2024-10-13 02:05:21,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080802343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:05:21,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:05:21,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:05:21,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425356143] [2024-10-13 02:05:21,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:05:21,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:05:21,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:05:21,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:05:21,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:05:21,156 INFO L87 Difference]: Start difference. First operand 253 states and 389 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:05:21,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:05:21,233 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2024-10-13 02:05:21,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:05:21,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2024-10-13 02:05:21,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:05:21,240 INFO L225 Difference]: With dead ends: 470 [2024-10-13 02:05:21,240 INFO L226 Difference]: Without dead ends: 318 [2024-10-13 02:05:21,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:05:21,242 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 172 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:05:21,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 452 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:05:21,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-10-13 02:05:21,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 253. [2024-10-13 02:05:21,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 184 states have (on average 1.358695652173913) internal successors, (250), 184 states have internal predecessors, (250), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 02:05:21,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 382 transitions. [2024-10-13 02:05:21,280 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 382 transitions. Word has length 208 [2024-10-13 02:05:21,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:05:21,281 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 382 transitions. [2024-10-13 02:05:21,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:05:21,281 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 382 transitions. [2024-10-13 02:05:21,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-13 02:05:21,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:05:21,283 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:05:21,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 02:05:21,284 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:05:21,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:05:21,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1001872686, now seen corresponding path program 1 times [2024-10-13 02:05:21,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:05:21,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586442650] [2024-10-13 02:05:21,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:05:21,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:05:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:05:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:05:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:05:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:05:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:05:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:05:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:05:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:05:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:05:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:05:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:05:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:21,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:05:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:22,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:05:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:22,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:05:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:22,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:05:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:22,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:05:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:22,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:05:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:22,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:05:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:22,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:05:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:22,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:05:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:22,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:05:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:22,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:05:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:22,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:05:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:22,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:05:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:22,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 02:05:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:22,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:05:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:22,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:05:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:22,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:05:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:22,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:05:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:22,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 02:05:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:22,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 02:05:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:22,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 02:05:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:22,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-13 02:05:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:22,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:05:22,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:05:22,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586442650] [2024-10-13 02:05:22,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586442650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:05:22,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:05:22,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 02:05:22,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682607370] [2024-10-13 02:05:22,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:05:22,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 02:05:22,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:05:22,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 02:05:22,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:05:22,098 INFO L87 Difference]: Start difference. First operand 253 states and 382 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:05:22,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:05:22,616 INFO L93 Difference]: Finished difference Result 638 states and 957 transitions. [2024-10-13 02:05:22,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:05:22,617 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-10-13 02:05:22,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:05:22,622 INFO L225 Difference]: With dead ends: 638 [2024-10-13 02:05:22,622 INFO L226 Difference]: Without dead ends: 386 [2024-10-13 02:05:22,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-13 02:05:22,625 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 140 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 02:05:22,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 881 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 02:05:22,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-10-13 02:05:22,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 371. [2024-10-13 02:05:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 268 states have (on average 1.335820895522388) internal successors, (358), 268 states have internal predecessors, (358), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-13 02:05:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 556 transitions. [2024-10-13 02:05:22,667 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 556 transitions. Word has length 209 [2024-10-13 02:05:22,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:05:22,668 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 556 transitions. [2024-10-13 02:05:22,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:05:22,668 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 556 transitions. [2024-10-13 02:05:22,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-13 02:05:22,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:05:22,671 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:05:22,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 02:05:22,671 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:05:22,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:05:22,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1864531170, now seen corresponding path program 1 times [2024-10-13 02:05:22,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:05:22,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062674101] [2024-10-13 02:05:22,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:05:22,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:05:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:05:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:05:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:05:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:05:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:05:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:05:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:05:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:05:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:05:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:05:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:05:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:05:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:05:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:05:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:05:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:05:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:05:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:05:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:05:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:05:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:05:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:05:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:05:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:05:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 02:05:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:05:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:05:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:05:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:05:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 02:05:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 02:05:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 02:05:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-13 02:05:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:05:23,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:05:23,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062674101] [2024-10-13 02:05:23,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062674101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:05:23,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:05:23,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:05:23,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451943364] [2024-10-13 02:05:23,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:05:23,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:05:23,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:05:23,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:05:23,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:05:23,233 INFO L87 Difference]: Start difference. First operand 371 states and 556 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:05:23,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:05:23,354 INFO L93 Difference]: Finished difference Result 800 states and 1203 transitions. [2024-10-13 02:05:23,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:05:23,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-10-13 02:05:23,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:05:23,360 INFO L225 Difference]: With dead ends: 800 [2024-10-13 02:05:23,360 INFO L226 Difference]: Without dead ends: 430 [2024-10-13 02:05:23,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:05:23,362 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 153 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:05:23,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 618 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:05:23,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-10-13 02:05:23,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 371. [2024-10-13 02:05:23,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 268 states have (on average 1.3171641791044777) internal successors, (353), 268 states have internal predecessors, (353), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-13 02:05:23,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 551 transitions. [2024-10-13 02:05:23,438 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 551 transitions. Word has length 210 [2024-10-13 02:05:23,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:05:23,439 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 551 transitions. [2024-10-13 02:05:23,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:05:23,439 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 551 transitions. [2024-10-13 02:05:23,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-13 02:05:23,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:05:23,444 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:05:23,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 02:05:23,444 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:05:23,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:05:23,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1700119221, now seen corresponding path program 1 times [2024-10-13 02:05:23,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:05:23,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322612477] [2024-10-13 02:05:23,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:05:23,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:05:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:05:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:05:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:05:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:05:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:05:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:05:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:05:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:05:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:05:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:05:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:05:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:05:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:05:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:05:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:05:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:05:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:05:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:05:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:05:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:05:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:05:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:05:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:05:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:05:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 02:05:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:05:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:05:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:05:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:05:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 02:05:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 02:05:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 02:05:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-13 02:05:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:05:23,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:05:23,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322612477] [2024-10-13 02:05:23,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322612477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:05:23,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:05:23,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:05:23,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634896511] [2024-10-13 02:05:23,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:05:23,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:05:23,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:05:23,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:05:23,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:05:23,740 INFO L87 Difference]: Start difference. First operand 371 states and 551 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:05:24,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:05:24,292 INFO L93 Difference]: Finished difference Result 650 states and 972 transitions. [2024-10-13 02:05:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 02:05:24,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213 [2024-10-13 02:05:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:05:24,297 INFO L225 Difference]: With dead ends: 650 [2024-10-13 02:05:24,297 INFO L226 Difference]: Without dead ends: 498 [2024-10-13 02:05:24,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:05:24,299 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 286 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 02:05:24,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 912 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 02:05:24,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-10-13 02:05:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 371. [2024-10-13 02:05:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 268 states have (on average 1.3134328358208955) internal successors, (352), 268 states have internal predecessors, (352), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-13 02:05:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 550 transitions. [2024-10-13 02:05:24,376 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 550 transitions. Word has length 213 [2024-10-13 02:05:24,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:05:24,377 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 550 transitions. [2024-10-13 02:05:24,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:05:24,377 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 550 transitions. [2024-10-13 02:05:24,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-13 02:05:24,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:05:24,380 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:05:24,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 02:05:24,380 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:05:24,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:05:24,381 INFO L85 PathProgramCache]: Analyzing trace with hash 201175111, now seen corresponding path program 1 times [2024-10-13 02:05:24,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:05:24,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506535693] [2024-10-13 02:05:24,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:05:24,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:05:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:05:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:05:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:05:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:05:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:05:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:05:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:05:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:05:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:05:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:05:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:05:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:05:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:05:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:05:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:05:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:05:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:05:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:05:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:05:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:05:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:05:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:05:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:05:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:05:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 02:05:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:05:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:05:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:05:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:05:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 02:05:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 02:05:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 02:05:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-13 02:05:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:32,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:05:32,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:05:32,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506535693] [2024-10-13 02:05:32,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506535693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:05:32,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:05:32,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 02:05:32,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559160083] [2024-10-13 02:05:32,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:05:32,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 02:05:32,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:05:32,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 02:05:32,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-13 02:05:32,653 INFO L87 Difference]: Start difference. First operand 371 states and 550 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:05:35,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:05:35,044 INFO L93 Difference]: Finished difference Result 946 states and 1367 transitions. [2024-10-13 02:05:35,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 02:05:35,049 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214 [2024-10-13 02:05:35,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:05:35,054 INFO L225 Difference]: With dead ends: 946 [2024-10-13 02:05:35,054 INFO L226 Difference]: Without dead ends: 694 [2024-10-13 02:05:35,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-13 02:05:35,056 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 367 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:05:35,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 628 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 02:05:35,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-10-13 02:05:35,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 653. [2024-10-13 02:05:35,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 541 states have (on average 1.354898336414048) internal successors, (733), 544 states have internal predecessors, (733), 105 states have call successors, (105), 6 states have call predecessors, (105), 6 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-13 02:05:35,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 943 transitions. [2024-10-13 02:05:35,143 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 943 transitions. Word has length 214 [2024-10-13 02:05:35,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:05:35,143 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 943 transitions. [2024-10-13 02:05:35,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:05:35,144 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 943 transitions. [2024-10-13 02:05:35,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-13 02:05:35,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:05:35,147 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:05:35,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 02:05:35,147 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:05:35,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:05:35,148 INFO L85 PathProgramCache]: Analyzing trace with hash -308297979, now seen corresponding path program 1 times [2024-10-13 02:05:35,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:05:35,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555896583] [2024-10-13 02:05:35,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:05:35,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:05:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:05:35,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979975004] [2024-10-13 02:05:35,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:05:35,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:05:35,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:05:35,229 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:05:35,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 02:05:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:05:35,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 02:05:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:05:35,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 02:05:35,608 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 02:05:35,609 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 02:05:35,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 02:05:35,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:05:35,815 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:05:35,972 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 02:05:35,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:05:35 BoogieIcfgContainer [2024-10-13 02:05:35,977 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 02:05:35,977 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 02:05:35,978 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 02:05:35,978 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 02:05:35,978 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:05:18" (3/4) ... [2024-10-13 02:05:35,980 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 02:05:35,982 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 02:05:35,982 INFO L158 Benchmark]: Toolchain (without parser) took 19220.86ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 107.4MB in the beginning and 230.2MB in the end (delta: -122.9MB). Peak memory consumption was 102.9MB. Max. memory is 16.1GB. [2024-10-13 02:05:35,982 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 98.6MB. Free memory is still 50.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:05:35,983 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.88ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 127.4MB in the end (delta: -20.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 02:05:35,983 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.09ms. Allocated memory is still 167.8MB. Free memory was 127.4MB in the beginning and 121.9MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:05:35,983 INFO L158 Benchmark]: Boogie Preprocessor took 86.86ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 114.0MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 02:05:35,984 INFO L158 Benchmark]: RCFGBuilder took 760.37ms. Allocated memory is still 167.8MB. Free memory was 114.0MB in the beginning and 75.7MB in the end (delta: 38.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-13 02:05:35,984 INFO L158 Benchmark]: TraceAbstraction took 17787.67ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 75.0MB in the beginning and 230.2MB in the end (delta: -155.3MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. [2024-10-13 02:05:35,984 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 394.3MB. Free memory is still 230.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:05:35,986 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 98.6MB. Free memory is still 50.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 497.88ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 127.4MB in the end (delta: -20.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.09ms. Allocated memory is still 167.8MB. Free memory was 127.4MB in the beginning and 121.9MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.86ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 114.0MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 760.37ms. Allocated memory is still 167.8MB. Free memory was 114.0MB in the beginning and 75.7MB in the end (delta: 38.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 17787.67ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 75.0MB in the beginning and 230.2MB in the end (delta: -155.3MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 394.3MB. Free memory is still 230.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 201, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someUnaryDOUBLEoperation at line 48. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed short int var_1_24 = -4; [L40] signed char var_1_27 = 64; [L41] unsigned short int var_1_29 = 8; [L42] unsigned char var_1_30 = 16; [L43] unsigned short int var_1_33 = 48416; [L44] unsigned char var_1_35 = 4; [L45] unsigned char var_1_36 = 25; [L46] unsigned long int var_1_37 = 32; [L47] unsigned char var_1_38 = 8; [L48] double var_1_39 = -0.75; [L49] double var_1_40 = 31.75; [L50] double var_1_41 = 5.5; [L51] double var_1_42 = 32.5; [L52] signed char var_1_43 = 100; [L53] signed char var_1_44 = 50; [L54] signed char var_1_45 = 5; [L55] signed long int last_1_var_1_5 = 5; [L205] isInitial = 1 [L206] FCALL initially() [L207] COND TRUE 1 [L208] CALL updateLastVariables() [L198] last_1_var_1_5 = var_1_5 [L208] RET updateLastVariables() [L209] CALL updateVariables() [L144] var_1_9 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L145] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L146] var_1_10 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L147] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L148] var_1_11 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L149] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L150] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L150] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L151] var_1_12 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L152] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L153] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L153] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L154] var_1_13 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L155] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L156] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L156] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L157] var_1_14 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L158] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L159] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L159] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L160] var_1_18 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L161] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L162] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L162] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L163] var_1_19 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L164] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L165] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L165] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L166] var_1_23 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L167] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L168] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L168] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=64, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L169] var_1_27 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_27 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L170] RET assume_abort_if_not(var_1_27 >= -127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L171] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L171] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=16, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L172] var_1_30 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L173] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L174] CALL assume_abort_if_not(var_1_30 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L174] RET assume_abort_if_not(var_1_30 <= 255) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L175] CALL assume_abort_if_not(var_1_30 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L175] RET assume_abort_if_not(var_1_30 != 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=48416, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L176] var_1_33 = __VERIFIER_nondet_ushort() [L177] CALL assume_abort_if_not(var_1_33 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L177] RET assume_abort_if_not(var_1_33 >= 32767) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L178] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L178] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=25, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L179] var_1_36 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L180] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L181] CALL assume_abort_if_not(var_1_36 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L181] RET assume_abort_if_not(var_1_36 <= 254) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L182] var_1_39 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L183] RET assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L184] var_1_40 = __VERIFIER_nondet_double() [L185] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L185] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L186] var_1_41 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L187] RET assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_42=65/2, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L188] var_1_42 = __VERIFIER_nondet_double() [L189] CALL assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L189] RET assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=50, var_1_45=5, var_1_5=5, var_1_8=0] [L190] var_1_44 = __VERIFIER_nondet_char() [L191] CALL assume_abort_if_not(var_1_44 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L191] RET assume_abort_if_not(var_1_44 >= -1) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L192] CALL assume_abort_if_not(var_1_44 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L192] RET assume_abort_if_not(var_1_44 <= 126) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=5, var_1_5=5, var_1_8=0] [L193] var_1_45 = __VERIFIER_nondet_char() [L194] CALL assume_abort_if_not(var_1_45 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L194] RET assume_abort_if_not(var_1_45 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L195] CALL assume_abort_if_not(var_1_45 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L195] RET assume_abort_if_not(var_1_45 <= 126) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L209] RET updateVariables() [L210] CALL step() [L59] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L62] var_1_20 = var_1_8 [L63] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L64] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L67] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L68] COND FALSE !(\read(var_1_22)) [L75] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L77] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L78] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L79] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L80] COND FALSE !(\read(var_1_22)) [L87] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L92] signed long int stepLocal_4 = 256; [L93] unsigned char stepLocal_3 = var_1_22; [L94] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L95] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=5, var_1_8=0] [L98] COND FALSE !(stepLocal_3 || var_1_22) [L103] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L106] COND FALSE !(\read(var_1_22)) [L111] var_1_24 = ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=1, var_1_29=8, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L113] COND TRUE (var_1_20 / var_1_30) < var_1_27 [L114] var_1_29 = var_1_30 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=1, var_1_29=255, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L118] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=1, var_1_29=255, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=32, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L121] COND TRUE ((((var_1_8) < (var_1_1)) ? (var_1_8) : (var_1_1))) >= var_1_15 [L122] var_1_37 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=1, var_1_29=255, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=0, var_1_38=8, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L124] COND FALSE !((var_1_39 * (var_1_40 - var_1_41)) >= var_1_42) [L131] var_1_38 = var_1_36 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=1, var_1_29=255, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=0, var_1_38=0, var_1_43=100, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L133] COND FALSE !(((((var_1_39) > (64.75f)) ? (var_1_39) : (64.75f))) <= var_1_40) [L140] var_1_43 = var_1_44 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=1, var_1_29=255, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=0, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L210] RET step() [L211] CALL, EXPR property() [L201] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=1, var_1_29=255, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=0, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=1, var_1_29=255, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=0, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=1, var_1_29=255, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=0, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=1, var_1_29=255, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=0, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=1, var_1_29=255, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=0, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=1, var_1_29=255, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=0, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L201-L202] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L211] RET, EXPR property() [L211] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=1, var_1_29=255, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=0, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=0, var_1_12=63, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_27=1, var_1_29=255, var_1_30=255, var_1_33=32767, var_1_35=4, var_1_36=0, var_1_37=0, var_1_38=0, var_1_43=-1, var_1_44=-1, var_1_45=0, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.6s, OverallIterations: 9, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1445 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1445 mSDsluCounter, 4688 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2757 mSDsCounter, 201 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1439 IncrementalHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 201 mSolverCounterUnsat, 1931 mSDtfsCounter, 1439 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 615 GetRequests, 581 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=653occurred in iteration=8, InterpolantAutomatonStates: 38, 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, 8 MinimizatonAttempts, 433 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 2106 NumberOfCodeBlocks, 2106 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1670 ConstructedInterpolants, 0 QuantifiedInterpolants, 14298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 16896/16896 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 02:05:36,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 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-pe-co_file-97.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3365a81206d364d6796ce2111e3130ddc986e1964f44a787bf6a1f0911048837 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:05:38,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:05:38,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 02:05:38,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:05:38,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:05:38,380 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:05:38,381 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:05:38,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:05:38,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:05:38,383 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:05:38,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:05:38,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:05:38,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:05:38,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:05:38,386 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:05:38,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:05:38,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:05:38,390 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:05:38,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:05:38,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:05:38,391 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:05:38,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:05:38,391 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:05:38,392 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 02:05:38,393 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 02:05:38,393 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:05:38,394 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 02:05:38,394 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:05:38,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:05:38,395 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:05:38,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:05:38,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:05:38,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:05:38,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:05:38,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:05:38,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:05:38,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:05:38,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:05:38,398 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 02:05:38,399 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 02:05:38,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:05:38,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:05:38,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:05:38,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:05:38,400 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 02:05:38,400 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 -> 3365a81206d364d6796ce2111e3130ddc986e1964f44a787bf6a1f0911048837 [2024-10-13 02:05:38,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:05:38,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:05:38,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:05:38,735 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:05:38,735 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:05:38,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-97.i [2024-10-13 02:05:40,361 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:05:40,608 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:05:40,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-97.i [2024-10-13 02:05:40,618 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b38c4be3c/6e4204f0109f423e84afc72af3bbf2d9/FLAGe459bc47a [2024-10-13 02:05:40,942 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b38c4be3c/6e4204f0109f423e84afc72af3bbf2d9 [2024-10-13 02:05:40,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:05:40,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:05:40,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:05:40,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:05:40,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:05:40,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:05:40" (1/1) ... [2024-10-13 02:05:40,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d239a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:40, skipping insertion in model container [2024-10-13 02:05:40,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:05:40" (1/1) ... [2024-10-13 02:05:40,986 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:05:41,194 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-97.i[919,932] [2024-10-13 02:05:41,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:05:41,319 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:05:41,333 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-97.i[919,932] [2024-10-13 02:05:41,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:05:41,402 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:05:41,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:41 WrapperNode [2024-10-13 02:05:41,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:05:41,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:05:41,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:05:41,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:05:41,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:41" (1/1) ... [2024-10-13 02:05:41,431 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:41" (1/1) ... [2024-10-13 02:05:41,473 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2024-10-13 02:05:41,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:05:41,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:05:41,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:05:41,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:05:41,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:41" (1/1) ... [2024-10-13 02:05:41,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:41" (1/1) ... [2024-10-13 02:05:41,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:41" (1/1) ... [2024-10-13 02:05:41,519 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:05:41,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:41" (1/1) ... [2024-10-13 02:05:41,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:41" (1/1) ... [2024-10-13 02:05:41,538 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:41" (1/1) ... [2024-10-13 02:05:41,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:41" (1/1) ... [2024-10-13 02:05:41,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:41" (1/1) ... [2024-10-13 02:05:41,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:41" (1/1) ... [2024-10-13 02:05:41,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:05:41,569 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:05:41,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:05:41,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:05:41,570 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:41" (1/1) ... [2024-10-13 02:05:41,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:05:41,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:05:41,634 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:05:41,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:05:41,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:05:41,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 02:05:41,689 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:05:41,689 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:05:41,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:05:41,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:05:41,815 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:05:41,817 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:05:46,550 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 02:05:46,560 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:05:46,613 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:05:46,616 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:05:46,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:05:46 BoogieIcfgContainer [2024-10-13 02:05:46,618 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:05:46,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:05:46,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:05:46,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:05:46,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:05:40" (1/3) ... [2024-10-13 02:05:46,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c17e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:05:46, skipping insertion in model container [2024-10-13 02:05:46,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:05:41" (2/3) ... [2024-10-13 02:05:46,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c17e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:05:46, skipping insertion in model container [2024-10-13 02:05:46,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:05:46" (3/3) ... [2024-10-13 02:05:46,629 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-97.i [2024-10-13 02:05:46,645 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:05:46,645 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:05:46,718 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:05:46,729 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;@5636a39c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:05:46,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:05:46,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 02:05:46,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-13 02:05:46,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:05:46,756 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:05:46,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:05:46,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:05:46,764 INFO L85 PathProgramCache]: Analyzing trace with hash -858778811, now seen corresponding path program 1 times [2024-10-13 02:05:46,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:05:46,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248883867] [2024-10-13 02:05:46,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:05:46,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:05:46,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:05:46,790 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:05:46,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 02:05:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:47,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 02:05:47,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:05:47,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 988 proven. 0 refuted. 0 times theorem prover too weak. 1124 trivial. 0 not checked. [2024-10-13 02:05:47,400 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:05:47,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:05:47,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248883867] [2024-10-13 02:05:47,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248883867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:05:47,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:05:47,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:05:47,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969313691] [2024-10-13 02:05:47,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:05:47,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:05:47,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:05:47,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:05:47,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:05:47,444 INFO L87 Difference]: Start difference. First operand has 89 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 02:05:47,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:05:47,516 INFO L93 Difference]: Finished difference Result 175 states and 319 transitions. [2024-10-13 02:05:47,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:05:47,520 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 204 [2024-10-13 02:05:47,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:05:47,528 INFO L225 Difference]: With dead ends: 175 [2024-10-13 02:05:47,528 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 02:05:47,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:05:47,542 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:05:47,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:05:47,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 02:05:47,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-13 02:05:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 52 states have internal predecessors, (72), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 02:05:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 138 transitions. [2024-10-13 02:05:47,586 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 138 transitions. Word has length 204 [2024-10-13 02:05:47,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:05:47,587 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 138 transitions. [2024-10-13 02:05:47,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 02:05:47,587 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 138 transitions. [2024-10-13 02:05:47,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-13 02:05:47,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:05:47,591 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:05:47,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 02:05:47,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:05:47,793 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:05:47,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:05:47,794 INFO L85 PathProgramCache]: Analyzing trace with hash 451008695, now seen corresponding path program 1 times [2024-10-13 02:05:47,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:05:47,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551642641] [2024-10-13 02:05:47,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:05:47,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:05:47,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:05:47,806 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:05:47,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 02:05:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:48,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 02:05:48,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:05:50,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:05:50,553 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:05:50,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:05:50,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551642641] [2024-10-13 02:05:50,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551642641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:05:50,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:05:50,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:05:50,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430829966] [2024-10-13 02:05:50,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:05:50,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:05:50,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:05:50,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:05:50,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:05:50,560 INFO L87 Difference]: Start difference. First operand 87 states and 138 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:05:52,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:05:52,212 INFO L93 Difference]: Finished difference Result 318 states and 504 transitions. [2024-10-13 02:05:52,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:05:52,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2024-10-13 02:05:52,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:05:52,221 INFO L225 Difference]: With dead ends: 318 [2024-10-13 02:05:52,221 INFO L226 Difference]: Without dead ends: 232 [2024-10-13 02:05:52,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:05:52,226 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 168 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 02:05:52,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 620 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 02:05:52,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-13 02:05:52,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 171. [2024-10-13 02:05:52,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 102 states have (on average 1.3627450980392157) internal successors, (139), 102 states have internal predecessors, (139), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 02:05:52,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 271 transitions. [2024-10-13 02:05:52,279 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 271 transitions. Word has length 204 [2024-10-13 02:05:52,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:05:52,280 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 271 transitions. [2024-10-13 02:05:52,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:05:52,280 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 271 transitions. [2024-10-13 02:05:52,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-13 02:05:52,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:05:52,284 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:05:52,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 02:05:52,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:05:52,485 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:05:52,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:05:52,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1472077049, now seen corresponding path program 1 times [2024-10-13 02:05:52,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:05:52,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645037809] [2024-10-13 02:05:52,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:05:52,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:05:52,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:05:52,490 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:05:52,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 02:05:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:52,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 02:05:52,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:05:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1082 proven. 51 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2024-10-13 02:05:54,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:05:55,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 45 proven. 51 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-13 02:05:55,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:05:55,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645037809] [2024-10-13 02:05:55,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645037809] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:05:55,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:05:55,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-13 02:05:55,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282747153] [2024-10-13 02:05:55,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:05:55,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 02:05:55,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:05:55,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 02:05:55,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:05:55,371 INFO L87 Difference]: Start difference. First operand 171 states and 271 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-10-13 02:05:56,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:05:56,748 INFO L93 Difference]: Finished difference Result 262 states and 407 transitions. [2024-10-13 02:05:56,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 02:05:56,751 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 204 [2024-10-13 02:05:56,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:05:56,753 INFO L225 Difference]: With dead ends: 262 [2024-10-13 02:05:56,753 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 02:05:56,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-10-13 02:05:56,755 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 151 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:05:56,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 167 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 02:05:56,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 02:05:56,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2024-10-13 02:05:56,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 02:05:56,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2024-10-13 02:05:56,774 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 204 [2024-10-13 02:05:56,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:05:56,775 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2024-10-13 02:05:56,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-10-13 02:05:56,775 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2024-10-13 02:05:56,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-13 02:05:56,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:05:56,778 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:05:56,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-13 02:05:56,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:05:56,979 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:05:56,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:05:56,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1594875580, now seen corresponding path program 1 times [2024-10-13 02:05:56,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:05:56,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823272363] [2024-10-13 02:05:56,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:05:56,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:05:56,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:05:56,988 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:05:56,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 02:05:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:05:57,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 02:05:57,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:06:01,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 02:06:01,444 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:06:01,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:06:01,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823272363] [2024-10-13 02:06:01,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823272363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:06:01,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:06:01,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:06:01,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075669084] [2024-10-13 02:06:01,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:06:01,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:06:01,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:06:01,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:06:01,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:06:01,447 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:06:02,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:06:02,207 INFO L93 Difference]: Finished difference Result 277 states and 402 transitions. [2024-10-13 02:06:02,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:06:02,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2024-10-13 02:06:02,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:06:02,212 INFO L225 Difference]: With dead ends: 277 [2024-10-13 02:06:02,212 INFO L226 Difference]: Without dead ends: 190 [2024-10-13 02:06:02,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:06:02,215 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 80 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 02:06:02,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 424 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 02:06:02,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-13 02:06:02,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 173. [2024-10-13 02:06:02,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 102 states have internal predecessors, (121), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 02:06:02,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 253 transitions. [2024-10-13 02:06:02,270 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 253 transitions. Word has length 205 [2024-10-13 02:06:02,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:06:02,271 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 253 transitions. [2024-10-13 02:06:02,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 02:06:02,272 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 253 transitions. [2024-10-13 02:06:02,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-13 02:06:02,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:06:02,278 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:06:02,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 02:06:02,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:06:02,479 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:06:02,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:06:02,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1132361636, now seen corresponding path program 1 times [2024-10-13 02:06:02,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:06:02,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347868087] [2024-10-13 02:06:02,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:06:02,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:06:02,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:06:02,483 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:06:02,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 02:06:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:02,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 02:06:02,937 INFO L278 TraceCheckSpWp]: Computing forward predicates...