./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.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 ee1d4ab2254e09ab1c7ffa7d0c8fe840fd7239014a5c1c2ca5c976023f5a71b5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:19:19,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:19:19,378 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:19:19,382 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:19:19,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:19:19,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:19:19,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:19:19,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:19:19,410 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:19:19,412 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:19:19,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:19:19,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:19:19,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:19:19,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:19:19,414 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:19:19,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:19:19,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:19:19,414 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:19:19,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:19:19,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:19:19,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:19:19,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:19:19,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:19:19,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:19:19,417 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:19:19,417 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:19:19,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:19:19,417 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:19:19,417 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:19:19,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:19:19,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:19:19,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:19:19,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:19:19,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:19:19,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:19:19,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:19:19,419 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:19:19,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:19:19,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:19:19,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:19:19,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:19:19,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:19:19,421 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 -> ee1d4ab2254e09ab1c7ffa7d0c8fe840fd7239014a5c1c2ca5c976023f5a71b5 [2024-11-12 04:19:19,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:19:19,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:19:19,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:19:19,670 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:19:19,674 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:19:19,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2024-11-12 04:19:21,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:19:21,268 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:19:21,268 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2024-11-12 04:19:21,278 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56418df0f/25a3299e769745449c56964870c96eca/FLAG8625e28af [2024-11-12 04:19:21,291 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56418df0f/25a3299e769745449c56964870c96eca [2024-11-12 04:19:21,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:19:21,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:19:21,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:19:21,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:19:21,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:19:21,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:19:21" (1/1) ... [2024-11-12 04:19:21,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13a5b591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:19:21, skipping insertion in model container [2024-11-12 04:19:21,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:19:21" (1/1) ... [2024-11-12 04:19:21,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:19:21,473 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i[919,932] [2024-11-12 04:19:21,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:19:21,561 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:19:21,572 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i[919,932] [2024-11-12 04:19:21,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:19:21,613 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:19:21,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:19:21 WrapperNode [2024-11-12 04:19:21,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:19:21,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:19:21,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:19:21,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:19:21,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:19:21" (1/1) ... [2024-11-12 04:19:21,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:19:21" (1/1) ... [2024-11-12 04:19:21,657 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-11-12 04:19:21,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:19:21,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:19:21,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:19:21,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:19:21,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:19:21" (1/1) ... [2024-11-12 04:19:21,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:19:21" (1/1) ... [2024-11-12 04:19:21,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:19:21" (1/1) ... [2024-11-12 04:19:21,692 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:19:21,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:19:21" (1/1) ... [2024-11-12 04:19:21,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:19:21" (1/1) ... [2024-11-12 04:19:21,701 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:19:21" (1/1) ... [2024-11-12 04:19:21,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:19:21" (1/1) ... [2024-11-12 04:19:21,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:19:21" (1/1) ... [2024-11-12 04:19:21,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:19:21" (1/1) ... [2024-11-12 04:19:21,710 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:19:21,711 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:19:21,711 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:19:21,711 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:19:21,712 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:19:21" (1/1) ... [2024-11-12 04:19:21,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:19:21,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:19:21,744 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:19:21,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:19:21,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:19:21,785 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:19:21,785 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:19:21,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:19:21,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:19:21,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:19:21,855 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:19:21,857 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:19:22,313 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-12 04:19:22,313 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:19:22,328 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:19:22,328 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:19:22,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:19:22 BoogieIcfgContainer [2024-11-12 04:19:22,329 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:19:22,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:19:22,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:19:22,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:19:22,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:19:21" (1/3) ... [2024-11-12 04:19:22,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b204caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:19:22, skipping insertion in model container [2024-11-12 04:19:22,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:19:21" (2/3) ... [2024-11-12 04:19:22,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b204caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:19:22, skipping insertion in model container [2024-11-12 04:19:22,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:19:22" (3/3) ... [2024-11-12 04:19:22,340 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2024-11-12 04:19:22,358 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:19:22,359 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:19:22,421 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:19:22,427 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;@1c86f655, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:19:22,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:19:22,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 59 states have internal predecessors, (86), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 04:19:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 04:19:22,445 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:19:22,446 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:19:22,448 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:19:22,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:19:22,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1675600109, now seen corresponding path program 1 times [2024-11-12 04:19:22,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:19:22,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622551419] [2024-11-12 04:19:22,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:19:22,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:19:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:19:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:19:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:19:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:19:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:19:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:19:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:19:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:19:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:19:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:19:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:19:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:19:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:19:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:19:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:19:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:19:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:19:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:19:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:19:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:19:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:19:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:19:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:19:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:19:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 04:19:22,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:19:22,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622551419] [2024-11-12 04:19:22,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622551419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:19:22,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:19:22,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:19:22,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270037779] [2024-11-12 04:19:22,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:19:22,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:19:22,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:19:22,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:19:22,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:19:22,924 INFO L87 Difference]: Start difference. First operand has 85 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 59 states have internal predecessors, (86), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 04:19:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:19:22,952 INFO L93 Difference]: Finished difference Result 163 states and 286 transitions. [2024-11-12 04:19:22,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:19:22,954 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2024-11-12 04:19:22,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:19:22,960 INFO L225 Difference]: With dead ends: 163 [2024-11-12 04:19:22,961 INFO L226 Difference]: Without dead ends: 81 [2024-11-12 04:19:22,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:19:22,967 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:19:22,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:19:22,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-12 04:19:23,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-12 04:19:23,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 04:19:23,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 127 transitions. [2024-11-12 04:19:23,015 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 127 transitions. Word has length 161 [2024-11-12 04:19:23,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:19:23,016 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 127 transitions. [2024-11-12 04:19:23,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 04:19:23,016 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 127 transitions. [2024-11-12 04:19:23,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 04:19:23,020 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:19:23,020 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:19:23,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:19:23,021 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:19:23,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:19:23,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1970234289, now seen corresponding path program 1 times [2024-11-12 04:19:23,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:19:23,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236257384] [2024-11-12 04:19:23,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:19:23,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:19:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:19:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:19:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:19:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:19:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:19:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:19:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:19:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:19:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:19:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:19:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:19:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:19:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:19:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:19:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:19:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:19:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:19:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:19:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:19:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:19:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:19:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:19:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:19:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:19:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 04:19:23,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:19:23,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236257384] [2024-11-12 04:19:23,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236257384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:19:23,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:19:23,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:19:23,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129413731] [2024-11-12 04:19:23,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:19:23,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:19:23,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:19:23,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:19:23,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:19:23,456 INFO L87 Difference]: Start difference. First operand 81 states and 127 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:19:23,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:19:23,538 INFO L93 Difference]: Finished difference Result 237 states and 375 transitions. [2024-11-12 04:19:23,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:19:23,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-11-12 04:19:23,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:19:23,543 INFO L225 Difference]: With dead ends: 237 [2024-11-12 04:19:23,543 INFO L226 Difference]: Without dead ends: 159 [2024-11-12 04:19:23,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:19:23,546 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 81 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:19:23,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 248 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:19:23,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-12 04:19:23,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2024-11-12 04:19:23,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 106 states have (on average 1.4433962264150944) internal successors, (153), 106 states have internal predecessors, (153), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 04:19:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 249 transitions. [2024-11-12 04:19:23,582 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 249 transitions. Word has length 161 [2024-11-12 04:19:23,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:19:23,583 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 249 transitions. [2024-11-12 04:19:23,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:19:23,583 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 249 transitions. [2024-11-12 04:19:23,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 04:19:23,585 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:19:23,585 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:19:23,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 04:19:23,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:19:23,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:19:23,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1902031181, now seen corresponding path program 1 times [2024-11-12 04:19:23,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:19:23,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522106799] [2024-11-12 04:19:23,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:19:23,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:19:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:19:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:19:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:19:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:19:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:19:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:19:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:19:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:19:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:19:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:23,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:19:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:19:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:19:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:19:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:19:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:19:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:19:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:19:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:19:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:19:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:19:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:19:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:19:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:19:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:19:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 04:19:24,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:19:24,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522106799] [2024-11-12 04:19:24,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522106799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:19:24,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:19:24,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 04:19:24,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512222079] [2024-11-12 04:19:24,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:19:24,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 04:19:24,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:19:24,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 04:19:24,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 04:19:24,088 INFO L87 Difference]: Start difference. First operand 157 states and 249 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:19:24,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:19:24,466 INFO L93 Difference]: Finished difference Result 562 states and 899 transitions. [2024-11-12 04:19:24,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 04:19:24,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-11-12 04:19:24,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:19:24,470 INFO L225 Difference]: With dead ends: 562 [2024-11-12 04:19:24,471 INFO L226 Difference]: Without dead ends: 408 [2024-11-12 04:19:24,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:19:24,473 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 205 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:19:24,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 423 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:19:24,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-12 04:19:24,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 353. [2024-11-12 04:19:24,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 227 states have (on average 1.3920704845814977) internal successors, (316), 227 states have internal predecessors, (316), 120 states have call successors, (120), 5 states have call predecessors, (120), 5 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-12 04:19:24,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 556 transitions. [2024-11-12 04:19:24,523 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 556 transitions. Word has length 161 [2024-11-12 04:19:24,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:19:24,525 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 556 transitions. [2024-11-12 04:19:24,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:19:24,526 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 556 transitions. [2024-11-12 04:19:24,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 04:19:24,532 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:19:24,532 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:19:24,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 04:19:24,532 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:19:24,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:19:24,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1642936337, now seen corresponding path program 1 times [2024-11-12 04:19:24,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:19:24,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842189938] [2024-11-12 04:19:24,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:19:24,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:19:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:19:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:19:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:19:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:19:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:19:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:19:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:19:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:19:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:19:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:19:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:19:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:19:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:19:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:19:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:19:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:19:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:19:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:19:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:19:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:19:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:19:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:19:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:19:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:19:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 04:19:24,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:19:24,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842189938] [2024-11-12 04:19:24,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842189938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:19:24,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:19:24,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:19:24,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123930750] [2024-11-12 04:19:24,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:19:24,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:19:24,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:19:24,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:19:24,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:19:24,797 INFO L87 Difference]: Start difference. First operand 353 states and 556 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:19:24,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:19:24,861 INFO L93 Difference]: Finished difference Result 525 states and 834 transitions. [2024-11-12 04:19:24,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:19:24,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-11-12 04:19:24,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:19:24,865 INFO L225 Difference]: With dead ends: 525 [2024-11-12 04:19:24,865 INFO L226 Difference]: Without dead ends: 223 [2024-11-12 04:19:24,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:19:24,867 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 59 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:19:24,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 221 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:19:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-12 04:19:24,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 205. [2024-11-12 04:19:24,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 129 states have (on average 1.37984496124031) internal successors, (178), 129 states have internal predecessors, (178), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-12 04:19:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 322 transitions. [2024-11-12 04:19:24,887 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 322 transitions. Word has length 162 [2024-11-12 04:19:24,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:19:24,887 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 322 transitions. [2024-11-12 04:19:24,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:19:24,888 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 322 transitions. [2024-11-12 04:19:24,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 04:19:24,889 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:19:24,889 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:19:24,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 04:19:24,889 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:19:24,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:19:24,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1667471603, now seen corresponding path program 1 times [2024-11-12 04:19:24,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:19:24,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584445360] [2024-11-12 04:19:24,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:19:24,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:19:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:19:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:19:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:19:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:19:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:19:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:19:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:19:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:19:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:19:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:19:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:19:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:19:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:19:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:19:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:19:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:19:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:19:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:19:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:19:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:19:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:19:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:19:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:19:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:19:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:27,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 04:19:27,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:19:27,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584445360] [2024-11-12 04:19:27,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584445360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:19:27,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:19:27,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 04:19:27,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400293691] [2024-11-12 04:19:27,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:19:27,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 04:19:27,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:19:27,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 04:19:27,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-12 04:19:27,901 INFO L87 Difference]: Start difference. First operand 205 states and 322 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:19:28,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:19:28,719 INFO L93 Difference]: Finished difference Result 545 states and 831 transitions. [2024-11-12 04:19:28,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 04:19:28,720 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-11-12 04:19:28,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:19:28,722 INFO L225 Difference]: With dead ends: 545 [2024-11-12 04:19:28,722 INFO L226 Difference]: Without dead ends: 391 [2024-11-12 04:19:28,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-12 04:19:28,738 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 180 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 04:19:28,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 842 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 04:19:28,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-12 04:19:28,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 279. [2024-11-12 04:19:28,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 193 states have (on average 1.4093264248704662) internal successors, (272), 195 states have internal predecessors, (272), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-12 04:19:28,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 432 transitions. [2024-11-12 04:19:28,777 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 432 transitions. Word has length 162 [2024-11-12 04:19:28,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:19:28,778 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 432 transitions. [2024-11-12 04:19:28,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:19:28,778 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 432 transitions. [2024-11-12 04:19:28,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 04:19:28,780 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:19:28,780 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:19:28,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 04:19:28,781 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:19:28,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:19:28,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1665624561, now seen corresponding path program 1 times [2024-11-12 04:19:28,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:19:28,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028950690] [2024-11-12 04:19:28,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:19:28,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:19:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:32,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:19:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:32,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:19:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:32,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:19:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:32,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:19:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:32,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:19:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:32,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:19:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:32,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:19:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:32,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:19:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:32,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:19:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:32,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:19:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:32,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:19:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:33,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:19:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:33,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:19:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:33,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:19:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:33,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:19:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:33,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:19:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:33,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:19:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:33,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:19:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:33,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:19:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:33,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:19:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:33,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:19:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:33,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:19:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:33,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:19:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:33,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:19:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 04:19:33,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:19:33,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028950690] [2024-11-12 04:19:33,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028950690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:19:33,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:19:33,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-12 04:19:33,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054041445] [2024-11-12 04:19:33,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:19:33,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 04:19:33,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:19:33,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 04:19:33,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-12 04:19:33,044 INFO L87 Difference]: Start difference. First operand 279 states and 432 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:19:35,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:19:35,083 INFO L93 Difference]: Finished difference Result 382 states and 561 transitions. [2024-11-12 04:19:35,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 04:19:35,083 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-11-12 04:19:35,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:19:35,086 INFO L225 Difference]: With dead ends: 382 [2024-11-12 04:19:35,086 INFO L226 Difference]: Without dead ends: 380 [2024-11-12 04:19:35,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-11-12 04:19:35,088 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 215 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 04:19:35,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 785 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 04:19:35,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-12 04:19:35,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 279. [2024-11-12 04:19:35,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 193 states have (on average 1.4093264248704662) internal successors, (272), 195 states have internal predecessors, (272), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-12 04:19:35,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 432 transitions. [2024-11-12 04:19:35,115 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 432 transitions. Word has length 162 [2024-11-12 04:19:35,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:19:35,116 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 432 transitions. [2024-11-12 04:19:35,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:19:35,116 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 432 transitions. [2024-11-12 04:19:35,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 04:19:35,118 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:19:35,118 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:19:35,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 04:19:35,118 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:19:35,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:19:35,118 INFO L85 PathProgramCache]: Analyzing trace with hash -987413233, now seen corresponding path program 1 times [2024-11-12 04:19:35,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:19:35,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762581558] [2024-11-12 04:19:35,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:19:35,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:19:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:19:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:19:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:19:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:19:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:19:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:19:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:19:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:19:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:19:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:19:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:19:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:19:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:19:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:19:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:19:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:19:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:19:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:19:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:19:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:19:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:19:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:19:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:19:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:19:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:38,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 04:19:38,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:19:38,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762581558] [2024-11-12 04:19:38,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762581558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:19:38,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:19:38,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 04:19:38,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384973611] [2024-11-12 04:19:38,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:19:38,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 04:19:38,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:19:38,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 04:19:38,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-12 04:19:38,758 INFO L87 Difference]: Start difference. First operand 279 states and 432 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:19:39,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:19:39,707 INFO L93 Difference]: Finished difference Result 389 states and 569 transitions. [2024-11-12 04:19:39,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 04:19:39,711 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-11-12 04:19:39,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:19:39,714 INFO L225 Difference]: With dead ends: 389 [2024-11-12 04:19:39,714 INFO L226 Difference]: Without dead ends: 387 [2024-11-12 04:19:39,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-12 04:19:39,720 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 173 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 04:19:39,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 810 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 04:19:39,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-12 04:19:39,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 283. [2024-11-12 04:19:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 197 states have (on average 1.4111675126903553) internal successors, (278), 199 states have internal predecessors, (278), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-12 04:19:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 438 transitions. [2024-11-12 04:19:39,748 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 438 transitions. Word has length 162 [2024-11-12 04:19:39,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:19:39,749 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 438 transitions. [2024-11-12 04:19:39,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:19:39,749 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 438 transitions. [2024-11-12 04:19:39,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 04:19:39,751 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:19:39,751 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:19:39,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 04:19:39,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:19:39,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:19:39,752 INFO L85 PathProgramCache]: Analyzing trace with hash -985566191, now seen corresponding path program 1 times [2024-11-12 04:19:39,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:19:39,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732460577] [2024-11-12 04:19:39,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:19:39,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:19:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:43,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:19:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:43,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:19:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:43,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:19:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:43,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:19:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:43,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:19:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:43,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:19:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:43,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:19:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:43,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:19:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:43,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:19:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:43,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:19:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:43,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:19:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:43,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:19:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:43,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:19:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:43,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:19:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:43,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:19:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:43,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:19:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:43,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:19:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:43,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:19:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:43,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:19:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:43,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:19:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:43,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:19:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:44,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:19:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:44,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:19:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:44,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:19:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:44,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 04:19:44,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:19:44,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732460577] [2024-11-12 04:19:44,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732460577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:19:44,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:19:44,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-12 04:19:44,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413828659] [2024-11-12 04:19:44,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:19:44,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 04:19:44,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:19:44,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 04:19:44,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-12 04:19:44,006 INFO L87 Difference]: Start difference. First operand 283 states and 438 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:19:45,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:19:45,276 INFO L93 Difference]: Finished difference Result 387 states and 567 transitions. [2024-11-12 04:19:45,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 04:19:45,276 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-11-12 04:19:45,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:19:45,278 INFO L225 Difference]: With dead ends: 387 [2024-11-12 04:19:45,279 INFO L226 Difference]: Without dead ends: 385 [2024-11-12 04:19:45,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-11-12 04:19:45,279 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 153 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 04:19:45,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 760 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 04:19:45,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-12 04:19:45,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 279. [2024-11-12 04:19:45,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 193 states have (on average 1.4093264248704662) internal successors, (272), 195 states have internal predecessors, (272), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-12 04:19:45,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 432 transitions. [2024-11-12 04:19:45,297 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 432 transitions. Word has length 162 [2024-11-12 04:19:45,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:19:45,298 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 432 transitions. [2024-11-12 04:19:45,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:19:45,298 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 432 transitions. [2024-11-12 04:19:45,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 04:19:45,299 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:19:45,299 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:19:45,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 04:19:45,300 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:19:45,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:19:45,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1409306165, now seen corresponding path program 1 times [2024-11-12 04:19:45,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:19:45,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623945400] [2024-11-12 04:19:45,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:19:45,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:19:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:19:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:19:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:19:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:19:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:19:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:19:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:19:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:19:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:19:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:19:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:19:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:19:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:19:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:19:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:19:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:19:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:19:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:19:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:19:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:19:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:19:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:19:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:19:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:19:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 04:19:45,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:19:45,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623945400] [2024-11-12 04:19:45,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623945400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:19:45,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:19:45,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:19:45,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993484947] [2024-11-12 04:19:45,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:19:45,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:19:45,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:19:45,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:19:45,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:19:45,361 INFO L87 Difference]: Start difference. First operand 279 states and 432 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:19:45,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:19:45,402 INFO L93 Difference]: Finished difference Result 639 states and 997 transitions. [2024-11-12 04:19:45,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:19:45,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-11-12 04:19:45,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:19:45,405 INFO L225 Difference]: With dead ends: 639 [2024-11-12 04:19:45,405 INFO L226 Difference]: Without dead ends: 411 [2024-11-12 04:19:45,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:19:45,407 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 108 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:19:45,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 335 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:19:45,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-12 04:19:45,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2024-11-12 04:19:45,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 293 states have (on average 1.3651877133105803) internal successors, (400), 296 states have internal predecessors, (400), 108 states have call successors, (108), 7 states have call predecessors, (108), 7 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-12 04:19:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 616 transitions. [2024-11-12 04:19:45,431 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 616 transitions. Word has length 162 [2024-11-12 04:19:45,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:19:45,431 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 616 transitions. [2024-11-12 04:19:45,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:19:45,432 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 616 transitions. [2024-11-12 04:19:45,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 04:19:45,433 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:19:45,433 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:19:45,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 04:19:45,433 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:19:45,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:19:45,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2076314505, now seen corresponding path program 1 times [2024-11-12 04:19:45,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:19:45,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604048792] [2024-11-12 04:19:45,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:19:45,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:19:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:19:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:19:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:19:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:19:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:19:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:19:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:19:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:19:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:19:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:19:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:19:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:19:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:19:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:19:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:19:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:19:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:19:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:19:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:19:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:19:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:19:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:19:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:19:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:19:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:45,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 04:19:45,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:19:45,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604048792] [2024-11-12 04:19:45,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604048792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:19:45,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:19:45,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 04:19:45,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601414775] [2024-11-12 04:19:45,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:19:45,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 04:19:45,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:19:45,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 04:19:45,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:19:45,555 INFO L87 Difference]: Start difference. First operand 409 states and 616 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:19:45,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:19:45,742 INFO L93 Difference]: Finished difference Result 899 states and 1330 transitions. [2024-11-12 04:19:45,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 04:19:45,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-11-12 04:19:45,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:19:45,746 INFO L225 Difference]: With dead ends: 899 [2024-11-12 04:19:45,746 INFO L226 Difference]: Without dead ends: 565 [2024-11-12 04:19:45,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:19:45,748 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 92 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:19:45,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 374 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:19:45,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-12 04:19:45,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 520. [2024-11-12 04:19:45,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 373 states have (on average 1.3485254691689008) internal successors, (503), 377 states have internal predecessors, (503), 136 states have call successors, (136), 10 states have call predecessors, (136), 10 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-12 04:19:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 775 transitions. [2024-11-12 04:19:45,778 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 775 transitions. Word has length 162 [2024-11-12 04:19:45,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:19:45,779 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 775 transitions. [2024-11-12 04:19:45,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:19:45,779 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 775 transitions. [2024-11-12 04:19:45,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 04:19:45,781 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:19:45,781 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:19:45,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 04:19:45,781 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:19:45,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:19:45,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1538594421, now seen corresponding path program 1 times [2024-11-12 04:19:45,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:19:45,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980075620] [2024-11-12 04:19:45,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:19:45,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:19:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:19:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:19:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:19:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:19:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:19:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:19:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:19:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:19:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:19:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:19:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:19:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:19:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:19:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:19:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:19:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:19:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:19:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:19:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:19:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:19:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:19:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:19:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:19:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:19:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 04:19:48,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:19:48,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980075620] [2024-11-12 04:19:48,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980075620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:19:48,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:19:48,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 04:19:48,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114502236] [2024-11-12 04:19:48,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:19:48,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 04:19:48,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:19:48,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 04:19:48,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-12 04:19:48,184 INFO L87 Difference]: Start difference. First operand 520 states and 775 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-12 04:19:49,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:19:49,583 INFO L93 Difference]: Finished difference Result 666 states and 942 transitions. [2024-11-12 04:19:49,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 04:19:49,584 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 162 [2024-11-12 04:19:49,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:19:49,589 INFO L225 Difference]: With dead ends: 666 [2024-11-12 04:19:49,589 INFO L226 Difference]: Without dead ends: 664 [2024-11-12 04:19:49,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2024-11-12 04:19:49,590 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 466 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 04:19:49,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 726 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 04:19:49,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2024-11-12 04:19:49,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 576. [2024-11-12 04:19:49,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 418 states have (on average 1.3301435406698565) internal successors, (556), 424 states have internal predecessors, (556), 144 states have call successors, (144), 13 states have call predecessors, (144), 13 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2024-11-12 04:19:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 844 transitions. [2024-11-12 04:19:49,633 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 844 transitions. Word has length 162 [2024-11-12 04:19:49,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:19:49,634 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 844 transitions. [2024-11-12 04:19:49,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-12 04:19:49,634 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 844 transitions. [2024-11-12 04:19:49,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 04:19:49,636 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:19:49,636 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:19:49,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 04:19:49,636 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:19:49,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:19:49,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1536747379, now seen corresponding path program 1 times [2024-11-12 04:19:49,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:19:49,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915496273] [2024-11-12 04:19:49,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:19:49,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:19:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:19:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:19:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:19:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:19:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:19:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:19:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:19:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:19:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:19:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:19:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:19:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:19:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:19:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:19:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:19:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:19:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:19:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:19:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:19:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:19:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:19:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:19:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:19:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:19:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:52,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 04:19:52,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:19:52,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915496273] [2024-11-12 04:19:52,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915496273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:19:52,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:19:52,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 04:19:52,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659494160] [2024-11-12 04:19:52,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:19:52,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 04:19:52,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:19:52,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 04:19:52,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-12 04:19:52,751 INFO L87 Difference]: Start difference. First operand 576 states and 844 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:19:54,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:19:54,550 INFO L93 Difference]: Finished difference Result 664 states and 940 transitions. [2024-11-12 04:19:54,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 04:19:54,550 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-11-12 04:19:54,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:19:54,559 INFO L225 Difference]: With dead ends: 664 [2024-11-12 04:19:54,560 INFO L226 Difference]: Without dead ends: 662 [2024-11-12 04:19:54,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-11-12 04:19:54,560 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 279 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-12 04:19:54,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 722 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-12 04:19:54,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-12 04:19:54,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 576. [2024-11-12 04:19:54,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 418 states have (on average 1.3301435406698565) internal successors, (556), 424 states have internal predecessors, (556), 144 states have call successors, (144), 13 states have call predecessors, (144), 13 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2024-11-12 04:19:54,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 844 transitions. [2024-11-12 04:19:54,640 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 844 transitions. Word has length 162 [2024-11-12 04:19:54,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:19:54,641 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 844 transitions. [2024-11-12 04:19:54,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:19:54,641 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 844 transitions. [2024-11-12 04:19:54,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 04:19:54,646 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:19:54,647 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:19:54,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 04:19:54,647 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:19:54,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:19:54,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2040689679, now seen corresponding path program 1 times [2024-11-12 04:19:54,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:19:54,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116939612] [2024-11-12 04:19:54,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:19:54,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:19:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:19:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:19:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:19:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:19:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:19:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:19:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:19:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:19:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:19:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:19:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:19:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:19:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:19:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:19:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:19:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:19:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:19:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:19:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:19:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:19:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:19:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:19:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:19:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:19:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 04:19:54,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:19:54,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116939612] [2024-11-12 04:19:54,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116939612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:19:54,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:19:54,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 04:19:54,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455355031] [2024-11-12 04:19:54,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:19:54,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 04:19:54,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:19:54,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 04:19:54,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:19:54,932 INFO L87 Difference]: Start difference. First operand 576 states and 844 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 04:19:55,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:19:55,143 INFO L93 Difference]: Finished difference Result 1088 states and 1578 transitions. [2024-11-12 04:19:55,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 04:19:55,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 162 [2024-11-12 04:19:55,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:19:55,147 INFO L225 Difference]: With dead ends: 1088 [2024-11-12 04:19:55,147 INFO L226 Difference]: Without dead ends: 585 [2024-11-12 04:19:55,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:19:55,149 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 147 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:19:55,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 210 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:19:55,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-12 04:19:55,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 575. [2024-11-12 04:19:55,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 408 states have (on average 1.2941176470588236) internal successors, (528), 414 states have internal predecessors, (528), 150 states have call successors, (150), 16 states have call predecessors, (150), 16 states have return successors, (150), 144 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-12 04:19:55,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 828 transitions. [2024-11-12 04:19:55,189 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 828 transitions. Word has length 162 [2024-11-12 04:19:55,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:19:55,189 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 828 transitions. [2024-11-12 04:19:55,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 04:19:55,189 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 828 transitions. [2024-11-12 04:19:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-12 04:19:55,191 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:19:55,191 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:19:55,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 04:19:55,191 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:19:55,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:19:55,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1030808172, now seen corresponding path program 1 times [2024-11-12 04:19:55,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:19:55,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215855286] [2024-11-12 04:19:55,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:19:55,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:19:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:19:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:19:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:19:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:19:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:19:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:19:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:19:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:19:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:19:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:19:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:19:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:19:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:19:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:19:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:19:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:19:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:19:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:19:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:19:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:19:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:19:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:19:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:19:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:19:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 04:19:55,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:19:55,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215855286] [2024-11-12 04:19:55,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215855286] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:19:55,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675334441] [2024-11-12 04:19:55,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:19:55,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:19:55,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:19:55,370 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:19:55,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 04:19:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:55,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 04:19:55,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:19:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 365 proven. 12 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2024-11-12 04:19:55,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:19:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 04:19:56,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675334441] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:19:56,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 04:19:56,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2024-11-12 04:19:56,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601680666] [2024-11-12 04:19:56,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 04:19:56,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 04:19:56,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:19:56,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 04:19:56,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-12 04:19:56,225 INFO L87 Difference]: Start difference. First operand 575 states and 828 transitions. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 5 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 5 states have call successors, (72) [2024-11-12 04:19:56,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:19:56,844 INFO L93 Difference]: Finished difference Result 1529 states and 2182 transitions. [2024-11-12 04:19:56,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-12 04:19:56,845 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 5 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 5 states have call successors, (72) Word has length 163 [2024-11-12 04:19:56,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:19:56,850 INFO L225 Difference]: With dead ends: 1529 [2024-11-12 04:19:56,850 INFO L226 Difference]: Without dead ends: 1014 [2024-11-12 04:19:56,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=228, Invalid=528, Unknown=0, NotChecked=0, Total=756 [2024-11-12 04:19:56,853 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 346 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 04:19:56,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 559 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 04:19:56,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2024-11-12 04:19:56,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 892. [2024-11-12 04:19:56,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 624 states have (on average 1.2612179487179487) internal successors, (787), 638 states have internal predecessors, (787), 240 states have call successors, (240), 27 states have call predecessors, (240), 27 states have return successors, (240), 226 states have call predecessors, (240), 240 states have call successors, (240) [2024-11-12 04:19:56,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1267 transitions. [2024-11-12 04:19:56,926 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1267 transitions. Word has length 163 [2024-11-12 04:19:56,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:19:56,927 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1267 transitions. [2024-11-12 04:19:56,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 5 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 5 states have call successors, (72) [2024-11-12 04:19:56,927 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1267 transitions. [2024-11-12 04:19:56,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-12 04:19:56,929 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:19:56,929 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:19:56,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 04:19:57,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-12 04:19:57,131 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:19:57,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:19:57,131 INFO L85 PathProgramCache]: Analyzing trace with hash 642456483, now seen corresponding path program 1 times [2024-11-12 04:19:57,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:19:57,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333407726] [2024-11-12 04:19:57,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:19:57,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:19:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 04:19:57,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [339160054] [2024-11-12 04:19:57,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:19:57,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:19:57,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:19:57,204 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:19:57,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 04:19:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:19:57,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-12 04:19:57,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:19:58,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 625 proven. 132 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-11-12 04:19:58,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:20:24,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:20:24,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333407726] [2024-11-12 04:20:24,449 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 04:20:24,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339160054] [2024-11-12 04:20:24,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339160054] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:20:24,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 04:20:24,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2024-11-12 04:20:24,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519026970] [2024-11-12 04:20:24,457 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 04:20:24,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 04:20:24,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:20:24,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 04:20:24,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=268, Unknown=1, NotChecked=0, Total=342 [2024-11-12 04:20:24,459 INFO L87 Difference]: Start difference. First operand 892 states and 1267 transitions. Second operand has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 5 states have call successors, (24), 5 states have call predecessors, (24), 8 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2024-11-12 04:20:28,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:20:28,479 INFO L93 Difference]: Finished difference Result 1547 states and 2030 transitions. [2024-11-12 04:20:28,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-12 04:20:28,479 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 5 states have call successors, (24), 5 states have call predecessors, (24), 8 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) Word has length 164 [2024-11-12 04:20:28,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:20:28,486 INFO L225 Difference]: With dead ends: 1547 [2024-11-12 04:20:28,486 INFO L226 Difference]: Without dead ends: 1255 [2024-11-12 04:20:28,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=301, Invalid=1030, Unknown=1, NotChecked=0, Total=1332 [2024-11-12 04:20:28,490 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 157 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 51 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:20:28,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 511 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 600 Invalid, 2 Unknown, 0 Unchecked, 2.1s Time] [2024-11-12 04:20:28,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-12 04:20:28,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1026. [2024-11-12 04:20:28,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 725 states have (on average 1.2165517241379311) internal successors, (882), 739 states have internal predecessors, (882), 236 states have call successors, (236), 64 states have call predecessors, (236), 64 states have return successors, (236), 222 states have call predecessors, (236), 236 states have call successors, (236) [2024-11-12 04:20:28,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1354 transitions. [2024-11-12 04:20:28,588 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1354 transitions. Word has length 164 [2024-11-12 04:20:28,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:20:28,589 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1354 transitions. [2024-11-12 04:20:28,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 5 states have call successors, (24), 5 states have call predecessors, (24), 8 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2024-11-12 04:20:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1354 transitions. [2024-11-12 04:20:28,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-12 04:20:28,590 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:20:28,590 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:20:28,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 04:20:28,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-12 04:20:28,796 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:20:28,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:20:28,797 INFO L85 PathProgramCache]: Analyzing trace with hash 644303525, now seen corresponding path program 1 times [2024-11-12 04:20:28,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:20:28,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289539781] [2024-11-12 04:20:28,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:20:28,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:20:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 04:20:28,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [916178747] [2024-11-12 04:20:28,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:20:28,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:20:28,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:20:28,878 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:20:28,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 04:20:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:20:28,993 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:20:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:20:29,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:20:29,111 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:20:29,112 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:20:29,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 04:20:29,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:20:29,321 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:20:29,411 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:20:29,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:20:29 BoogieIcfgContainer [2024-11-12 04:20:29,415 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:20:29,416 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:20:29,416 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:20:29,416 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:20:29,416 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:19:22" (3/4) ... [2024-11-12 04:20:29,419 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:20:29,420 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:20:29,421 INFO L158 Benchmark]: Toolchain (without parser) took 68126.33ms. Allocated memory was 169.9MB in the beginning and 836.8MB in the end (delta: 666.9MB). Free memory was 98.0MB in the beginning and 316.3MB in the end (delta: -218.2MB). Peak memory consumption was 450.6MB. Max. memory is 16.1GB. [2024-11-12 04:20:29,421 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 125.8MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:20:29,421 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.81ms. Allocated memory is still 169.9MB. Free memory was 97.6MB in the beginning and 81.1MB in the end (delta: 16.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 04:20:29,421 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.78ms. Allocated memory is still 169.9MB. Free memory was 81.1MB in the beginning and 77.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 04:20:29,422 INFO L158 Benchmark]: Boogie Preprocessor took 52.38ms. Allocated memory is still 169.9MB. Free memory was 77.4MB in the beginning and 72.4MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 04:20:29,422 INFO L158 Benchmark]: RCFGBuilder took 617.69ms. Allocated memory is still 169.9MB. Free memory was 72.4MB in the beginning and 120.9MB in the end (delta: -48.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 04:20:29,422 INFO L158 Benchmark]: TraceAbstraction took 67083.30ms. Allocated memory was 169.9MB in the beginning and 836.8MB in the end (delta: 666.9MB). Free memory was 120.0MB in the beginning and 316.3MB in the end (delta: -196.2MB). Peak memory consumption was 472.3MB. Max. memory is 16.1GB. [2024-11-12 04:20:29,422 INFO L158 Benchmark]: Witness Printer took 4.63ms. Allocated memory is still 836.8MB. Free memory is still 316.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:20:29,423 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.09ms. Allocated memory is still 125.8MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.81ms. Allocated memory is still 169.9MB. Free memory was 97.6MB in the beginning and 81.1MB in the end (delta: 16.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.78ms. Allocated memory is still 169.9MB. Free memory was 81.1MB in the beginning and 77.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.38ms. Allocated memory is still 169.9MB. Free memory was 77.4MB in the beginning and 72.4MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 617.69ms. Allocated memory is still 169.9MB. Free memory was 72.4MB in the beginning and 120.9MB in the end (delta: -48.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 67083.30ms. Allocated memory was 169.9MB in the beginning and 836.8MB in the end (delta: 666.9MB). Free memory was 120.0MB in the beginning and 316.3MB in the end (delta: -196.2MB). Peak memory consumption was 472.3MB. Max. memory is 16.1GB. * Witness Printer took 4.63ms. Allocated memory is still 836.8MB. Free memory is still 316.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someUnaryDOUBLEoperation at line 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 50; [L23] signed char var_1_3 = 8; [L24] signed char var_1_4 = 10; [L25] double var_1_5 = 16.5; [L26] signed char var_1_6 = 64; [L27] signed char var_1_7 = 2; [L28] unsigned short int var_1_8 = 256; [L29] unsigned short int var_1_10 = 63583; [L30] unsigned short int var_1_11 = 33789; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_14 = 0; [L33] signed long int var_1_15 = 8; [L34] signed short int var_1_16 = -16; [L35] signed short int var_1_18 = 16; [L36] signed short int var_1_19 = 25; [L37] signed short int var_1_20 = 25; [L38] signed short int var_1_21 = 50; [L39] signed long int var_1_22 = -8; [L40] unsigned long int var_1_26 = 10; [L41] signed long int var_1_28 = -10000; [L42] signed long int var_1_29 = -1263929197; [L43] signed short int var_1_31 = 1; [L44] unsigned char var_1_36 = 32; [L45] unsigned char var_1_38 = 2; [L46] double var_1_39 = 3.6; [L47] double var_1_40 = 24.25; [L48] double var_1_41 = 31.25; [L49] unsigned long int var_1_42 = 10; [L50] unsigned char last_1_var_1_12 = 1; VAL [isInitial=0, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=8, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L179] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=8, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L189] RET updateLastVariables() [L190] CALL updateVariables() [L140] var_1_3 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L141] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L142] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L142] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L143] var_1_4 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L144] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L145] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L145] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L146] var_1_6 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L147] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L148] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L148] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L149] var_1_7 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L150] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L151] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L151] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L152] var_1_10 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_10 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L153] RET assume_abort_if_not(var_1_10 >= 49150) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L154] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L154] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L155] var_1_11 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L156] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L157] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L157] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L158] var_1_14 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L159] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L160] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L160] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L161] var_1_20 = __VERIFIER_nondet_short() [L162] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L162] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L163] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L163] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L164] var_1_21 = __VERIFIER_nondet_short() [L165] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L165] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L166] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L166] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L167] var_1_29 = __VERIFIER_nondet_long() [L168] CALL assume_abort_if_not(var_1_29 >= -2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L168] RET assume_abort_if_not(var_1_29 >= -2147483646) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L169] CALL assume_abort_if_not(var_1_29 <= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L169] RET assume_abort_if_not(var_1_29 <= -1073741823) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L170] var_1_38 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L171] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L172] CALL assume_abort_if_not(var_1_38 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L172] RET assume_abort_if_not(var_1_38 <= 254) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L173] var_1_40 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_40 >= -922337.2036854765600e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L174] RET assume_abort_if_not((var_1_40 >= -922337.2036854765600e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_41=125/4, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L175] var_1_41 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L176] RET assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L190] RET updateVariables() [L191] CALL step() [L54] COND FALSE !(var_1_16 > var_1_18) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L59] var_1_26 = var_1_8 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L60] COND FALSE !(((((-256) < 0 ) ? -(-256) : (-256))) < var_1_19) [L63] var_1_28 = var_1_29 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L65] COND TRUE var_1_8 > var_1_18 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L66] COND TRUE var_1_29 < var_1_18 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L67] COND TRUE var_1_29 <= (-64 & var_1_19) [L68] var_1_31 = ((((var_1_1) > (((((8) < (var_1_1)) ? (8) : (var_1_1))))) ? (var_1_1) : (((((8) < (var_1_1)) ? (8) : (var_1_1)))))) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L74] COND FALSE !(((((((((var_1_8) > (var_1_15)) ? (var_1_8) : (var_1_15)))) > (var_1_1)) ? (((((var_1_8) > (var_1_15)) ? (var_1_8) : (var_1_15)))) : (var_1_1))) > var_1_8) [L79] var_1_36 = var_1_38 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=18/5, var_1_3=-63, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L81] var_1_39 = ((((((((var_1_40) < 0 ) ? -(var_1_40) : (var_1_40)))) > (((((var_1_41) < (100.75)) ? (var_1_41) : (100.75))))) ? (((((var_1_40) < 0 ) ? -(var_1_40) : (var_1_40)))) : (((((var_1_41) < (100.75)) ? (var_1_41) : (100.75)))))) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=10, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L82] COND FALSE !(var_1_8 <= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) [L93] var_1_42 = var_1_38 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L95] signed char stepLocal_1 = var_1_6; [L96] unsigned char stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_1=-1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L97] COND FALSE !(-25 == stepLocal_1) [L102] var_1_8 = ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=32767] [L104] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_2=0, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=32767] [L105] COND TRUE var_1_8 >= stepLocal_2 [L106] var_1_12 = (! var_1_14) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=32767] [L108] COND TRUE \read(var_1_12) [L109] var_1_1 = (var_1_3 + var_1_4) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-2, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=32767] [L111] COND TRUE var_1_4 >= (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-2, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=61, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=32767] [L112] COND TRUE \read(var_1_12) [L113] var_1_5 = 8.25 VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-2, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=61, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=32767] [L116] signed char stepLocal_4 = var_1_6; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_4=-1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-2, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=61, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=32767] [L117] COND TRUE var_1_1 < stepLocal_4 [L118] var_1_18 = (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-1, var_1_19=25, var_1_1=-2, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=61, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=32767] [L122] COND TRUE \read(var_1_12) [L123] var_1_19 = ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-1, var_1_19=-16129, var_1_1=-2, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=61, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=32767] [L125] COND TRUE -64 > (var_1_6 + var_1_19) [L126] var_1_15 = (var_1_11 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32767, var_1_16=-16, var_1_18=-1, var_1_19=-16129, var_1_1=-2, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=61, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=32767] [L134] signed long int stepLocal_3 = ((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10); VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_3=32767, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32767, var_1_16=-16, var_1_18=-1, var_1_19=-16129, var_1_1=-2, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=61, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=32767] [L135] COND FALSE !(var_1_19 > stepLocal_3) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32767, var_1_16=-16, var_1_18=-1, var_1_19=-16129, var_1_1=-2, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=61, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=32767] [L191] RET step() [L192] CALL, EXPR property() [L182-L183] return (((((((var_1_12 ? (var_1_1 == ((signed char) (var_1_3 + var_1_4))) : 1) && ((var_1_4 >= (var_1_6 - var_1_7)) ? (var_1_12 ? (var_1_5 == ((double) 8.25)) : 1) : 1)) && ((-25 == var_1_6) ? ((last_1_var_1_12 && last_1_var_1_12) ? (var_1_8 == ((unsigned short int) ((((((var_1_10 - 10) - 16)) > ((var_1_11 - var_1_7))) ? (((var_1_10 - 10) - 16)) : ((var_1_11 - var_1_7)))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))))))) && ((var_1_8 >= var_1_7) ? (var_1_12 == ((unsigned char) (! var_1_14))) : 1)) && ((-64 > (var_1_6 + var_1_19)) ? (var_1_15 == ((signed long int) (var_1_11 - var_1_7))) : ((! var_1_12) ? (var_1_12 ? (var_1_15 == ((signed long int) 4)) : 1) : 1))) && ((var_1_19 > (((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10))) ? (var_1_16 == ((signed short int) var_1_4)) : 1)) && ((var_1_1 < var_1_6) ? (var_1_18 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_18 == ((signed short int) (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))))))) && (var_1_12 ? (var_1_19 == ((signed short int) ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32767, var_1_16=-16, var_1_18=-1, var_1_19=-16129, var_1_1=-2, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=61, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=32767] [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32767, var_1_16=-16, var_1_18=-1, var_1_19=-16129, var_1_1=-2, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=61, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32767, var_1_16=-16, var_1_18=-1, var_1_19=-16129, var_1_1=-2, var_1_20=16383, var_1_21=16128, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-63, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=61, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.9s, OverallIterations: 16, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 2689 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2661 mSDsluCounter, 7653 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5622 mSDsCounter, 344 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5322 IncrementalHoareTripleChecker+Invalid, 5668 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 344 mSolverCounterUnsat, 2031 mSDtfsCounter, 5322 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1398 GetRequests, 1223 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 15.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1026occurred in iteration=15, InterpolantAutomatonStates: 168, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 1080 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 49.9s InterpolantComputationTime, 3085 NumberOfCodeBlocks, 3085 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2739 ConstructedInterpolants, 1 QuantifiedInterpolants, 16870 SizeOfPredicates, 12 NumberOfNonLiveVariables, 777 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 18600/18768 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 04:20:29,640 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-12 04:20:29,699 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.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 ee1d4ab2254e09ab1c7ffa7d0c8fe840fd7239014a5c1c2ca5c976023f5a71b5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:20:31,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:20:31,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:20:31,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:20:31,747 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:20:31,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:20:31,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:20:31,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:20:31,784 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:20:31,784 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:20:31,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:20:31,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:20:31,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:20:31,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:20:31,786 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:20:31,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:20:31,786 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:20:31,786 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:20:31,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:20:31,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:20:31,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:20:31,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:20:31,788 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:20:31,788 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:20:31,788 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:20:31,788 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:20:31,789 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:20:31,789 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:20:31,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:20:31,789 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:20:31,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:20:31,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:20:31,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:20:31,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:20:31,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:20:31,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:20:31,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:20:31,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:20:31,792 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:20:31,792 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:20:31,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:20:31,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:20:31,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:20:31,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:20:31,793 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 -> ee1d4ab2254e09ab1c7ffa7d0c8fe840fd7239014a5c1c2ca5c976023f5a71b5 [2024-11-12 04:20:32,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:20:32,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:20:32,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:20:32,110 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:20:32,113 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:20:32,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2024-11-12 04:20:33,676 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:20:33,853 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:20:33,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2024-11-12 04:20:33,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fde946e58/14681ec8eaea4a1bab6e761e95bd1f53/FLAG319e44d50 [2024-11-12 04:20:34,237 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fde946e58/14681ec8eaea4a1bab6e761e95bd1f53 [2024-11-12 04:20:34,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:20:34,242 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:20:34,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:20:34,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:20:34,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:20:34,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:20:34" (1/1) ... [2024-11-12 04:20:34,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@757bb229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:34, skipping insertion in model container [2024-11-12 04:20:34,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:20:34" (1/1) ... [2024-11-12 04:20:34,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:20:34,447 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i[919,932] [2024-11-12 04:20:34,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:20:34,563 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:20:34,577 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i[919,932] [2024-11-12 04:20:34,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:20:34,639 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:20:34,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:34 WrapperNode [2024-11-12 04:20:34,639 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:20:34,640 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:20:34,640 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:20:34,640 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:20:34,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:34" (1/1) ... [2024-11-12 04:20:34,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:34" (1/1) ... [2024-11-12 04:20:34,687 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-11-12 04:20:34,689 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:20:34,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:20:34,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:20:34,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:20:34,698 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:34" (1/1) ... [2024-11-12 04:20:34,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:34" (1/1) ... [2024-11-12 04:20:34,702 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:34" (1/1) ... [2024-11-12 04:20:34,718 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:20:34,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:34" (1/1) ... [2024-11-12 04:20:34,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:34" (1/1) ... [2024-11-12 04:20:34,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:34" (1/1) ... [2024-11-12 04:20:34,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:34" (1/1) ... [2024-11-12 04:20:34,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:34" (1/1) ... [2024-11-12 04:20:34,741 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:34" (1/1) ... [2024-11-12 04:20:34,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:20:34,747 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:20:34,749 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:20:34,749 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:20:34,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:34" (1/1) ... [2024-11-12 04:20:34,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:20:34,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:20:34,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:20:34,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:20:34,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:20:34,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:20:34,818 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:20:34,818 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:20:34,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:20:34,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:20:34,909 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:20:34,912 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:20:35,311 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-12 04:20:35,311 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:20:35,323 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:20:35,323 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:20:35,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:20:35 BoogieIcfgContainer [2024-11-12 04:20:35,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:20:35,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:20:35,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:20:35,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:20:35,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:20:34" (1/3) ... [2024-11-12 04:20:35,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fbe969e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:20:35, skipping insertion in model container [2024-11-12 04:20:35,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:20:34" (2/3) ... [2024-11-12 04:20:35,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fbe969e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:20:35, skipping insertion in model container [2024-11-12 04:20:35,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:20:35" (3/3) ... [2024-11-12 04:20:35,331 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2024-11-12 04:20:35,346 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:20:35,346 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:20:35,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:20:35,404 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;@7b104f18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:20:35,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:20:35,409 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 59 states have internal predecessors, (86), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 04:20:35,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 04:20:35,421 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:20:35,422 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:20:35,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:20:35,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:20:35,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1675600109, now seen corresponding path program 1 times [2024-11-12 04:20:35,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:20:35,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1038500371] [2024-11-12 04:20:35,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:20:35,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:20:35,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:20:35,449 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:20:35,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 04:20:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:20:35,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 04:20:35,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:20:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-12 04:20:35,798 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:20:35,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:20:35,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1038500371] [2024-11-12 04:20:35,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1038500371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:20:35,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:20:35,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:20:35,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344659027] [2024-11-12 04:20:35,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:20:35,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:20:35,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:20:35,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:20:35,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:20:35,856 INFO L87 Difference]: Start difference. First operand has 85 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 59 states have internal predecessors, (86), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 04:20:35,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:20:35,889 INFO L93 Difference]: Finished difference Result 163 states and 286 transitions. [2024-11-12 04:20:35,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:20:35,891 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2024-11-12 04:20:35,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:20:35,899 INFO L225 Difference]: With dead ends: 163 [2024-11-12 04:20:35,899 INFO L226 Difference]: Without dead ends: 81 [2024-11-12 04:20:35,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:20:35,908 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:20:35,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:20:35,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-12 04:20:35,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-12 04:20:35,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 04:20:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 127 transitions. [2024-11-12 04:20:35,956 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 127 transitions. Word has length 161 [2024-11-12 04:20:35,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:20:35,957 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 127 transitions. [2024-11-12 04:20:35,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 04:20:35,957 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 127 transitions. [2024-11-12 04:20:35,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 04:20:35,960 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:20:35,960 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:20:35,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 04:20:36,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:20:36,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:20:36,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:20:36,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1970234289, now seen corresponding path program 1 times [2024-11-12 04:20:36,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:20:36,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459871682] [2024-11-12 04:20:36,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:20:36,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:20:36,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:20:36,175 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:20:36,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 04:20:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:20:36,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 04:20:36,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:20:36,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 04:20:36,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:20:36,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:20:36,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459871682] [2024-11-12 04:20:36,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459871682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:20:36,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:20:36,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:20:36,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48899991] [2024-11-12 04:20:36,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:20:36,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:20:36,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:20:36,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:20:36,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:20:36,669 INFO L87 Difference]: Start difference. First operand 81 states and 127 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:20:36,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:20:36,754 INFO L93 Difference]: Finished difference Result 237 states and 375 transitions. [2024-11-12 04:20:36,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:20:36,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-11-12 04:20:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:20:36,761 INFO L225 Difference]: With dead ends: 237 [2024-11-12 04:20:36,761 INFO L226 Difference]: Without dead ends: 159 [2024-11-12 04:20:36,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:20:36,763 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 54 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:20:36,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 248 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:20:36,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-12 04:20:36,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2024-11-12 04:20:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 106 states have (on average 1.4433962264150944) internal successors, (153), 106 states have internal predecessors, (153), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 04:20:36,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 249 transitions. [2024-11-12 04:20:36,783 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 249 transitions. Word has length 161 [2024-11-12 04:20:36,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:20:36,784 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 249 transitions. [2024-11-12 04:20:36,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:20:36,784 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 249 transitions. [2024-11-12 04:20:36,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 04:20:36,786 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:20:36,786 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:20:36,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 04:20:36,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:20:36,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:20:36,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:20:36,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1902031181, now seen corresponding path program 1 times [2024-11-12 04:20:36,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:20:36,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634785247] [2024-11-12 04:20:36,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:20:36,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:20:36,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:20:36,993 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:20:36,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 04:20:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:20:37,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 04:20:37,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:20:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 04:20:37,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:20:37,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:20:37,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634785247] [2024-11-12 04:20:37,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634785247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:20:37,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:20:37,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:20:37,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248736709] [2024-11-12 04:20:37,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:20:37,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:20:37,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:20:37,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:20:37,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:20:37,723 INFO L87 Difference]: Start difference. First operand 157 states and 249 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:20:37,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:20:37,843 INFO L93 Difference]: Finished difference Result 375 states and 597 transitions. [2024-11-12 04:20:37,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:20:37,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-11-12 04:20:37,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:20:37,847 INFO L225 Difference]: With dead ends: 375 [2024-11-12 04:20:37,847 INFO L226 Difference]: Without dead ends: 221 [2024-11-12 04:20:37,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:20:37,850 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 25 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:20:37,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 226 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:20:37,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-12 04:20:37,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2024-11-12 04:20:37,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 140 states have (on average 1.3857142857142857) internal successors, (194), 140 states have internal predecessors, (194), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-12 04:20:37,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 338 transitions. [2024-11-12 04:20:37,881 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 338 transitions. Word has length 161 [2024-11-12 04:20:37,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:20:37,881 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 338 transitions. [2024-11-12 04:20:37,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 04:20:37,882 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 338 transitions. [2024-11-12 04:20:37,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 04:20:37,887 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:20:37,888 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:20:37,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 04:20:38,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:20:38,089 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:20:38,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:20:38,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1667471603, now seen corresponding path program 1 times [2024-11-12 04:20:38,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:20:38,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124916243] [2024-11-12 04:20:38,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:20:38,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:20:38,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:20:38,096 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:20:38,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 04:20:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:20:38,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 04:20:38,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:20:38,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 365 proven. 12 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2024-11-12 04:20:38,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:20:38,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 04:20:38,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:20:38,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124916243] [2024-11-12 04:20:38,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124916243] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:20:38,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 04:20:38,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-12 04:20:38,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976946937] [2024-11-12 04:20:38,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 04:20:38,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 04:20:38,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:20:38,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 04:20:38,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-12 04:20:38,673 INFO L87 Difference]: Start difference. First operand 216 states and 338 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2024-11-12 04:20:39,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:20:39,291 INFO L93 Difference]: Finished difference Result 485 states and 750 transitions. [2024-11-12 04:20:39,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 04:20:39,291 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) Word has length 162 [2024-11-12 04:20:39,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:20:39,295 INFO L225 Difference]: With dead ends: 485 [2024-11-12 04:20:39,295 INFO L226 Difference]: Without dead ends: 322 [2024-11-12 04:20:39,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2024-11-12 04:20:39,296 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 224 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 04:20:39,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 314 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 04:20:39,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-12 04:20:39,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 310. [2024-11-12 04:20:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 195 states have (on average 1.3384615384615384) internal successors, (261), 197 states have internal predecessors, (261), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-12 04:20:39,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 477 transitions. [2024-11-12 04:20:39,331 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 477 transitions. Word has length 162 [2024-11-12 04:20:39,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:20:39,332 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 477 transitions. [2024-11-12 04:20:39,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2024-11-12 04:20:39,332 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 477 transitions. [2024-11-12 04:20:39,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-12 04:20:39,333 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:20:39,340 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:20:39,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-12 04:20:39,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:20:39,545 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:20:39,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:20:39,547 INFO L85 PathProgramCache]: Analyzing trace with hash 326167326, now seen corresponding path program 1 times [2024-11-12 04:20:39,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:20:39,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2068890344] [2024-11-12 04:20:39,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:20:39,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:20:39,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:20:39,553 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:20:39,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 04:20:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:20:39,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 04:20:39,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:20:41,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 616 proven. 132 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2024-11-12 04:20:41,615 INFO L312 TraceCheckSpWp]: Computing backward predicates...