./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-81.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 6d1c02b3372a206bee55669628072c3bed3eaa07fdec8b30d7cf878b8d085487 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:59:38,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:59:38,931 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:59:38,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:59:38,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:59:38,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:59:38,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:59:38,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:59:38,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:59:38,970 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:59:38,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:59:38,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:59:38,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:59:38,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:59:38,972 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:59:38,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:59:38,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:59:38,973 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:59:38,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:59:38,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:59:38,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:59:38,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:59:38,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:59:38,975 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:59:38,975 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:59:38,976 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:59:38,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:59:38,977 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:59:38,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:59:38,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:59:38,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:59:38,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:59:38,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:59:38,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:59:38,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:59:38,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:59:38,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:59:38,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:59:38,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:59:38,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:59:38,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:59:38,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:59:38,981 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-clean/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-clean/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 -> 6d1c02b3372a206bee55669628072c3bed3eaa07fdec8b30d7cf878b8d085487 [2024-10-11 12:59:39,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:59:39,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:59:39,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:59:39,235 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:59:39,235 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:59:39,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-81.i [2024-10-11 12:59:40,631 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:59:40,856 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:59:40,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-81.i [2024-10-11 12:59:40,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fe1e1503d/6b0681d200a54cda99f3681c423b465f/FLAGa5dd5c6f2 [2024-10-11 12:59:41,203 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fe1e1503d/6b0681d200a54cda99f3681c423b465f [2024-10-11 12:59:41,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:59:41,208 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:59:41,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:59:41,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:59:41,215 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:59:41,215 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:59:41" (1/1) ... [2024-10-11 12:59:41,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df2bcf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:41, skipping insertion in model container [2024-10-11 12:59:41,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:59:41" (1/1) ... [2024-10-11 12:59:41,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:59:41,426 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-81.i[915,928] [2024-10-11 12:59:41,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:59:41,501 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:59:41,510 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-81.i[915,928] [2024-10-11 12:59:41,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:59:41,555 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:59:41,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:41 WrapperNode [2024-10-11 12:59:41,557 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:59:41,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:59:41,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:59:41,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:59:41,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:41" (1/1) ... [2024-10-11 12:59:41,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:41" (1/1) ... [2024-10-11 12:59:41,619 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-10-11 12:59:41,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:59:41,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:59:41,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:59:41,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:59:41,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:41" (1/1) ... [2024-10-11 12:59:41,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:41" (1/1) ... [2024-10-11 12:59:41,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:41" (1/1) ... [2024-10-11 12:59:41,652 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:59:41,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:41" (1/1) ... [2024-10-11 12:59:41,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:41" (1/1) ... [2024-10-11 12:59:41,669 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:41" (1/1) ... [2024-10-11 12:59:41,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:41" (1/1) ... [2024-10-11 12:59:41,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:41" (1/1) ... [2024-10-11 12:59:41,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:41" (1/1) ... [2024-10-11 12:59:41,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:59:41,689 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:59:41,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:59:41,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:59:41,690 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:41" (1/1) ... [2024-10-11 12:59:41,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:59:41,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:59:41,724 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:59:41,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:59:41,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:59:41,770 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:59:41,771 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:59:41,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:59:41,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:59:41,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:59:41,858 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:59:41,861 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:59:42,135 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 12:59:42,135 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:59:42,156 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:59:42,156 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:59:42,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:59:42 BoogieIcfgContainer [2024-10-11 12:59:42,156 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:59:42,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:59:42,158 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:59:42,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:59:42,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:59:41" (1/3) ... [2024-10-11 12:59:42,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a0e708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:59:42, skipping insertion in model container [2024-10-11 12:59:42,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:41" (2/3) ... [2024-10-11 12:59:42,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a0e708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:59:42, skipping insertion in model container [2024-10-11 12:59:42,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:59:42" (3/3) ... [2024-10-11 12:59:42,163 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-81.i [2024-10-11 12:59:42,176 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:59:42,177 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:59:42,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:59:42,228 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;@b7dbe4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:59:42,229 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:59:42,238 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 43 states have internal predecessors, (60), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 12:59:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 12:59:42,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:59:42,251 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:59:42,251 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:59:42,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:59:42,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1234853277, now seen corresponding path program 1 times [2024-10-11 12:59:42,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:59:42,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067795435] [2024-10-11 12:59:42,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:59:42,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:59:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:59:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:59:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:59:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:59:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:59:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:59:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:59:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:59:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:59:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:59:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:59:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:59:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:59:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:59:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:59:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:59:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:59:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:59:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:59:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:59:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 12:59:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:59:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 12:59:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:59:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:59:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 12:59:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:59:42,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:59:42,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067795435] [2024-10-11 12:59:42,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067795435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:59:42,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:59:42,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:59:42,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853540463] [2024-10-11 12:59:42,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:59:42,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:59:42,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:59:42,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:59:42,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:59:42,848 INFO L87 Difference]: Start difference. First operand has 71 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 43 states have internal predecessors, (60), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 12:59:42,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:59:42,895 INFO L93 Difference]: Finished difference Result 139 states and 248 transitions. [2024-10-11 12:59:42,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:59:42,897 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 159 [2024-10-11 12:59:42,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:59:42,904 INFO L225 Difference]: With dead ends: 139 [2024-10-11 12:59:42,905 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 12:59:42,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:59:42,913 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:59:42,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:59:42,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 12:59:42,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-11 12:59:42,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 12:59:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 107 transitions. [2024-10-11 12:59:42,959 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 107 transitions. Word has length 159 [2024-10-11 12:59:42,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:59:42,959 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 107 transitions. [2024-10-11 12:59:42,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 12:59:42,959 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 107 transitions. [2024-10-11 12:59:42,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 12:59:42,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:59:42,964 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:59:42,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:59:42,964 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:59:42,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:59:42,966 INFO L85 PathProgramCache]: Analyzing trace with hash -125328291, now seen corresponding path program 1 times [2024-10-11 12:59:42,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:59:42,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568521301] [2024-10-11 12:59:42,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:59:42,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:59:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:59:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:59:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:59:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:59:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:59:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:59:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:59:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:59:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:59:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:59:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:59:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:59:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:59:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:59:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:59:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:59:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:59:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:59:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:59:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:59:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 12:59:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:59:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 12:59:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:59:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:59:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 12:59:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:59:52,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:59:52,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568521301] [2024-10-11 12:59:52,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568521301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:59:52,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:59:52,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 12:59:52,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478680404] [2024-10-11 12:59:52,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:59:52,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 12:59:52,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:59:52,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 12:59:52,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 12:59:52,166 INFO L87 Difference]: Start difference. First operand 69 states and 107 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:59:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:59:53,707 INFO L93 Difference]: Finished difference Result 218 states and 329 transitions. [2024-10-11 12:59:53,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 12:59:53,708 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 159 [2024-10-11 12:59:53,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:59:53,710 INFO L225 Difference]: With dead ends: 218 [2024-10-11 12:59:53,710 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 12:59:53,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-10-11 12:59:53,717 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 262 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 12:59:53,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 430 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 12:59:53,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 12:59:53,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 82. [2024-10-11 12:59:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 12:59:53,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2024-10-11 12:59:53,745 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 127 transitions. Word has length 159 [2024-10-11 12:59:53,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:59:53,746 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 127 transitions. [2024-10-11 12:59:53,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:59:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 127 transitions. [2024-10-11 12:59:53,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 12:59:53,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:59:53,755 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:59:53,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:59:53,756 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:59:53,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:59:53,756 INFO L85 PathProgramCache]: Analyzing trace with hash 554730079, now seen corresponding path program 1 times [2024-10-11 12:59:53,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:59:53,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760166543] [2024-10-11 12:59:53,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:59:53,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:59:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:59:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:59:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:59:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:59:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:59:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:59:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:59:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:59:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:59:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:59:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:59:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:59:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:59:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:59:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:59:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:59:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:59:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:59:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:59:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 12:59:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 12:59:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 12:59:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 12:59:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 12:59:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 12:59:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 12:59:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:59:53,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:59:53,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760166543] [2024-10-11 12:59:53,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760166543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:59:53,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:59:53,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:59:54,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481472831] [2024-10-11 12:59:54,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:59:54,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:59:54,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:59:54,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:59:54,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:59:54,003 INFO L87 Difference]: Start difference. First operand 82 states and 127 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:59:54,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:59:54,080 INFO L93 Difference]: Finished difference Result 193 states and 295 transitions. [2024-10-11 12:59:54,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:59:54,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 159 [2024-10-11 12:59:54,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:59:54,083 INFO L225 Difference]: With dead ends: 193 [2024-10-11 12:59:54,085 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 12:59:54,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:59:54,088 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 40 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:59:54,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 301 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:59:54,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 12:59:54,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2024-10-11 12:59:54,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 76 states have (on average 1.368421052631579) internal successors, (104), 77 states have internal predecessors, (104), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 12:59:54,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 164 transitions. [2024-10-11 12:59:54,106 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 164 transitions. Word has length 159 [2024-10-11 12:59:54,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:59:54,107 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 164 transitions. [2024-10-11 12:59:54,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:59:54,108 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 164 transitions. [2024-10-11 12:59:54,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 12:59:54,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:59:54,112 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:59:54,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 12:59:54,113 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:59:54,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:59:54,113 INFO L85 PathProgramCache]: Analyzing trace with hash -518355301, now seen corresponding path program 1 times [2024-10-11 12:59:54,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:59:54,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542380056] [2024-10-11 12:59:54,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:59:54,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:59:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:00:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:00:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:00:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:00:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:00:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:00:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:00:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:00:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:00:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 13:00:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:00:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:00:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:00:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 13:00:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 13:00:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 13:00:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 13:00:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:00:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:00:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 13:00:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 13:00:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 13:00:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 13:00:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:00:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:00:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 13:00:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:01,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 13:00:01,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:00:01,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542380056] [2024-10-11 13:00:01,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542380056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:00:01,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:00:01,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:00:01,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422156609] [2024-10-11 13:00:01,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:00:01,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:00:01,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:00:01,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:00:01,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:00:01,608 INFO L87 Difference]: Start difference. First operand 109 states and 164 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 13:00:04,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:00:04,325 INFO L93 Difference]: Finished difference Result 386 states and 572 transitions. [2024-10-11 13:00:04,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 13:00:04,325 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 159 [2024-10-11 13:00:04,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:00:04,335 INFO L225 Difference]: With dead ends: 386 [2024-10-11 13:00:04,335 INFO L226 Difference]: Without dead ends: 278 [2024-10-11 13:00:04,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-10-11 13:00:04,336 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 404 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:00:04,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 507 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 13:00:04,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-11 13:00:04,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 158. [2024-10-11 13:00:04,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 98 states have (on average 1.3265306122448979) internal successors, (130), 99 states have internal predecessors, (130), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 13:00:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 242 transitions. [2024-10-11 13:00:04,370 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 242 transitions. Word has length 159 [2024-10-11 13:00:04,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:00:04,371 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 242 transitions. [2024-10-11 13:00:04,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 13:00:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 242 transitions. [2024-10-11 13:00:04,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 13:00:04,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:00:04,373 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:00:04,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:00:04,374 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:00:04,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:00:04,374 INFO L85 PathProgramCache]: Analyzing trace with hash 575736287, now seen corresponding path program 1 times [2024-10-11 13:00:04,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:00:04,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472171721] [2024-10-11 13:00:04,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:00:04,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:00:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:00:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:00:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:00:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:00:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:00:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:00:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:00:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:00:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:00:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 13:00:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:00:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:00:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:00:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 13:00:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 13:00:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 13:00:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 13:00:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:00:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:00:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 13:00:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 13:00:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 13:00:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 13:00:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:00:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:00:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 13:00:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 13:00:04,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:00:04,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472171721] [2024-10-11 13:00:04,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472171721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:00:04,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:00:04,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:00:04,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561631585] [2024-10-11 13:00:04,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:00:04,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:00:04,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:00:04,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:00:04,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:00:04,901 INFO L87 Difference]: Start difference. First operand 158 states and 242 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 13:00:05,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:00:05,283 INFO L93 Difference]: Finished difference Result 319 states and 482 transitions. [2024-10-11 13:00:05,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:00:05,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 159 [2024-10-11 13:00:05,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:00:05,286 INFO L225 Difference]: With dead ends: 319 [2024-10-11 13:00:05,286 INFO L226 Difference]: Without dead ends: 211 [2024-10-11 13:00:05,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:00:05,287 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 96 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:00:05,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 411 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:00:05,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-11 13:00:05,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 164. [2024-10-11 13:00:05,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 104 states have (on average 1.3173076923076923) internal successors, (137), 105 states have internal predecessors, (137), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 13:00:05,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 249 transitions. [2024-10-11 13:00:05,308 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 249 transitions. Word has length 159 [2024-10-11 13:00:05,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:00:05,309 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 249 transitions. [2024-10-11 13:00:05,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 13:00:05,309 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 249 transitions. [2024-10-11 13:00:05,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 13:00:05,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:00:05,314 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:00:05,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:00:05,314 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:00:05,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:00:05,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1105161315, now seen corresponding path program 1 times [2024-10-11 13:00:05,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:00:05,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265928669] [2024-10-11 13:00:05,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:00:05,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:00:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:00:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:00:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:00:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:00:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:00:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:00:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:00:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:00:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:00:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 13:00:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:00:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:00:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:00:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 13:00:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 13:00:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 13:00:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 13:00:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:00:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:00:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 13:00:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 13:00:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 13:00:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 13:00:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:00:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:00:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 13:00:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:13,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 13:00:13,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:00:13,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265928669] [2024-10-11 13:00:13,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265928669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:00:13,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:00:13,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:00:13,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787610907] [2024-10-11 13:00:13,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:00:13,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:00:13,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:00:13,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:00:13,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:00:13,876 INFO L87 Difference]: Start difference. First operand 164 states and 249 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 13:00:15,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:00:15,214 INFO L93 Difference]: Finished difference Result 337 states and 503 transitions. [2024-10-11 13:00:15,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:00:15,214 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 159 [2024-10-11 13:00:15,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:00:15,216 INFO L225 Difference]: With dead ends: 337 [2024-10-11 13:00:15,217 INFO L226 Difference]: Without dead ends: 229 [2024-10-11 13:00:15,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:00:15,219 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 200 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:00:15,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 381 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:00:15,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-11 13:00:15,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 162. [2024-10-11 13:00:15,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 102 states have (on average 1.3235294117647058) internal successors, (135), 103 states have internal predecessors, (135), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 13:00:15,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 247 transitions. [2024-10-11 13:00:15,245 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 247 transitions. Word has length 159 [2024-10-11 13:00:15,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:00:15,247 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 247 transitions. [2024-10-11 13:00:15,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 13:00:15,247 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 247 transitions. [2024-10-11 13:00:15,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 13:00:15,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:00:15,248 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:00:15,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:00:15,249 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:00:15,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:00:15,249 INFO L85 PathProgramCache]: Analyzing trace with hash 678860108, now seen corresponding path program 1 times [2024-10-11 13:00:15,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:00:15,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743861904] [2024-10-11 13:00:15,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:00:15,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:00:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:00:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:00:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:00:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:00:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:00:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:00:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:00:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:00:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:00:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 13:00:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:00:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:00:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:00:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 13:00:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 13:00:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 13:00:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 13:00:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:00:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:00:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 13:00:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 13:00:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 13:00:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 13:00:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:00:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:00:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 13:00:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 13:00:15,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:00:15,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743861904] [2024-10-11 13:00:15,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743861904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:00:15,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:00:15,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:00:15,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635812980] [2024-10-11 13:00:15,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:00:15,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:00:15,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:00:15,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:00:15,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:00:15,402 INFO L87 Difference]: Start difference. First operand 162 states and 247 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 13:00:15,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:00:15,458 INFO L93 Difference]: Finished difference Result 296 states and 441 transitions. [2024-10-11 13:00:15,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:00:15,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2024-10-11 13:00:15,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:00:15,461 INFO L225 Difference]: With dead ends: 296 [2024-10-11 13:00:15,461 INFO L226 Difference]: Without dead ends: 188 [2024-10-11 13:00:15,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:00:15,463 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 58 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:00:15,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 300 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:00:15,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-11 13:00:15,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 159. [2024-10-11 13:00:15,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 13:00:15,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 238 transitions. [2024-10-11 13:00:15,481 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 238 transitions. Word has length 160 [2024-10-11 13:00:15,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:00:15,481 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 238 transitions. [2024-10-11 13:00:15,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 13:00:15,482 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 238 transitions. [2024-10-11 13:00:15,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 13:00:15,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:00:15,483 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:00:15,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:00:15,483 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:00:15,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:00:15,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1358918478, now seen corresponding path program 1 times [2024-10-11 13:00:15,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:00:15,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939769536] [2024-10-11 13:00:15,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:00:15,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:00:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:20,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:00:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:20,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:00:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:20,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:00:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:20,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:00:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:20,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:00:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:20,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:00:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:20,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:00:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:20,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:00:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:20,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:00:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:20,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 13:00:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:20,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:00:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:20,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:00:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:20,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:00:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:20,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 13:00:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:20,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 13:00:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:20,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 13:00:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:20,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 13:00:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:20,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:00:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:21,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:00:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:21,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 13:00:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:21,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 13:00:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:21,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 13:00:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:21,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 13:00:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:21,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:00:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:21,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:00:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:21,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 13:00:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:21,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 13:00:21,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:00:21,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939769536] [2024-10-11 13:00:21,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939769536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:00:21,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:00:21,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 13:00:21,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169999774] [2024-10-11 13:00:21,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:00:21,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:00:21,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:00:21,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:00:21,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:00:21,061 INFO L87 Difference]: Start difference. First operand 159 states and 238 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 13:00:22,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:00:22,389 INFO L93 Difference]: Finished difference Result 353 states and 515 transitions. [2024-10-11 13:00:22,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:00:22,390 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 160 [2024-10-11 13:00:22,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:00:22,392 INFO L225 Difference]: With dead ends: 353 [2024-10-11 13:00:22,393 INFO L226 Difference]: Without dead ends: 255 [2024-10-11 13:00:22,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2024-10-11 13:00:22,394 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 227 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:00:22,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 641 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:00:22,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-11 13:00:22,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 169. [2024-10-11 13:00:22,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 112 states have (on average 1.3214285714285714) internal successors, (148), 112 states have internal predecessors, (148), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 13:00:22,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 252 transitions. [2024-10-11 13:00:22,413 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 252 transitions. Word has length 160 [2024-10-11 13:00:22,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:00:22,414 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 252 transitions. [2024-10-11 13:00:22,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 13:00:22,414 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 252 transitions. [2024-10-11 13:00:22,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 13:00:22,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:00:22,415 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:00:22,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:00:22,415 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:00:22,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:00:22,416 INFO L85 PathProgramCache]: Analyzing trace with hash 965891468, now seen corresponding path program 1 times [2024-10-11 13:00:22,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:00:22,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082428410] [2024-10-11 13:00:22,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:00:22,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:00:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:00:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:00:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:00:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:00:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:00:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:00:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:00:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:00:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:00:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 13:00:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:00:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:00:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:00:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 13:00:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 13:00:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 13:00:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 13:00:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:00:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:00:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 13:00:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 13:00:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 13:00:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 13:00:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:00:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:00:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 13:00:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:27,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 13:00:27,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:00:27,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082428410] [2024-10-11 13:00:27,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082428410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:00:27,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:00:27,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:00:27,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271566146] [2024-10-11 13:00:27,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:00:27,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:00:27,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:00:27,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:00:27,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:00:27,796 INFO L87 Difference]: Start difference. First operand 169 states and 252 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 13:00:29,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:00:29,172 INFO L93 Difference]: Finished difference Result 324 states and 477 transitions. [2024-10-11 13:00:29,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:00:29,172 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 160 [2024-10-11 13:00:29,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:00:29,174 INFO L225 Difference]: With dead ends: 324 [2024-10-11 13:00:29,174 INFO L226 Difference]: Without dead ends: 226 [2024-10-11 13:00:29,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2024-10-11 13:00:29,176 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 145 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:00:29,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 565 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:00:29,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-11 13:00:29,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 167. [2024-10-11 13:00:29,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 110 states have (on average 1.3272727272727274) internal successors, (146), 110 states have internal predecessors, (146), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 13:00:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 250 transitions. [2024-10-11 13:00:29,196 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 250 transitions. Word has length 160 [2024-10-11 13:00:29,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:00:29,197 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 250 transitions. [2024-10-11 13:00:29,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 13:00:29,197 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 250 transitions. [2024-10-11 13:00:29,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 13:00:29,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:00:29,199 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:00:29,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:00:29,199 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:00:29,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:00:29,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1689977358, now seen corresponding path program 1 times [2024-10-11 13:00:29,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:00:29,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470104230] [2024-10-11 13:00:29,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:00:29,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:00:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:00:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:00:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:00:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:00:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:00:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:00:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:00:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:00:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:00:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 13:00:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:00:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:00:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:00:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 13:00:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 13:00:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 13:00:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 13:00:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:00:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:00:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 13:00:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 13:00:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 13:00:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 13:00:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:00:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:00:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 13:00:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:34,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 13:00:34,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:00:34,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470104230] [2024-10-11 13:00:34,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470104230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:00:34,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:00:34,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:00:34,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710139832] [2024-10-11 13:00:34,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:00:34,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:00:34,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:00:34,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:00:34,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:00:34,719 INFO L87 Difference]: Start difference. First operand 167 states and 250 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 13:00:36,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:00:36,110 INFO L93 Difference]: Finished difference Result 398 states and 577 transitions. [2024-10-11 13:00:36,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:00:36,110 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2024-10-11 13:00:36,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:00:36,112 INFO L225 Difference]: With dead ends: 398 [2024-10-11 13:00:36,112 INFO L226 Difference]: Without dead ends: 300 [2024-10-11 13:00:36,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:00:36,113 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 396 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:00:36,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 476 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 13:00:36,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-11 13:00:36,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 171. [2024-10-11 13:00:36,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 114 states have (on average 1.3333333333333333) internal successors, (152), 114 states have internal predecessors, (152), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 13:00:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 256 transitions. [2024-10-11 13:00:36,143 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 256 transitions. Word has length 160 [2024-10-11 13:00:36,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:00:36,143 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 256 transitions. [2024-10-11 13:00:36,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 13:00:36,143 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 256 transitions. [2024-10-11 13:00:36,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 13:00:36,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:00:36,145 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:00:36,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:00:36,146 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:00:36,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:00:36,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1924931568, now seen corresponding path program 1 times [2024-10-11 13:00:36,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:00:36,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351057874] [2024-10-11 13:00:36,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:00:36,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:00:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:00:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:00:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:00:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:00:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:00:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:00:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:00:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:00:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:00:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 13:00:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:00:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:00:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:00:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 13:00:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 13:00:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 13:00:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 13:00:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:00:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:00:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 13:00:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 13:00:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 13:00:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 13:00:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:00:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:00:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 13:00:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:40,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 13:00:40,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:00:40,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351057874] [2024-10-11 13:00:40,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351057874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:00:40,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:00:40,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:00:40,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183830899] [2024-10-11 13:00:40,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:00:40,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:00:40,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:00:40,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:00:40,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:00:40,109 INFO L87 Difference]: Start difference. First operand 171 states and 256 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 13:00:41,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:00:41,306 INFO L93 Difference]: Finished difference Result 360 states and 526 transitions. [2024-10-11 13:00:41,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:00:41,307 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 160 [2024-10-11 13:00:41,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:00:41,312 INFO L225 Difference]: With dead ends: 360 [2024-10-11 13:00:41,312 INFO L226 Difference]: Without dead ends: 262 [2024-10-11 13:00:41,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:00:41,315 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 274 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:00:41,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 593 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:00:41,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-11 13:00:41,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 173. [2024-10-11 13:00:41,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 116 states have (on average 1.3448275862068966) internal successors, (156), 116 states have internal predecessors, (156), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 13:00:41,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 260 transitions. [2024-10-11 13:00:41,345 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 260 transitions. Word has length 160 [2024-10-11 13:00:41,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:00:41,346 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 260 transitions. [2024-10-11 13:00:41,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 13:00:41,346 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 260 transitions. [2024-10-11 13:00:41,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 13:00:41,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:00:41,350 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:00:41,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 13:00:41,350 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:00:41,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:00:41,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1296950348, now seen corresponding path program 1 times [2024-10-11 13:00:41,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:00:41,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217788785] [2024-10-11 13:00:41,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:00:41,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:00:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:00:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:00:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:00:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:00:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:00:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:00:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:00:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:00:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:00:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 13:00:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:00:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:00:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:00:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 13:00:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 13:00:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 13:00:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 13:00:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:00:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:00:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 13:00:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 13:00:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 13:00:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 13:00:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:00:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:00:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 13:00:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:45,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 13:00:45,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:00:45,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217788785] [2024-10-11 13:00:45,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217788785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:00:45,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:00:45,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:00:45,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069338830] [2024-10-11 13:00:45,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:00:45,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:00:45,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:00:45,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:00:45,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:00:45,702 INFO L87 Difference]: Start difference. First operand 173 states and 260 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 13:00:50,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:00:50,080 INFO L93 Difference]: Finished difference Result 410 states and 591 transitions. [2024-10-11 13:00:50,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 13:00:50,081 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2024-10-11 13:00:50,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:00:50,082 INFO L225 Difference]: With dead ends: 410 [2024-10-11 13:00:50,082 INFO L226 Difference]: Without dead ends: 312 [2024-10-11 13:00:50,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2024-10-11 13:00:50,084 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 307 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:00:50,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 608 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 13:00:50,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-11 13:00:50,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 174. [2024-10-11 13:00:50,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 117 states have internal predecessors, (158), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 13:00:50,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 262 transitions. [2024-10-11 13:00:50,101 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 262 transitions. Word has length 160 [2024-10-11 13:00:50,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:00:50,101 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 262 transitions. [2024-10-11 13:00:50,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 13:00:50,101 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 262 transitions. [2024-10-11 13:00:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 13:00:50,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:00:50,102 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:00:50,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 13:00:50,102 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:00:50,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:00:50,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1977008718, now seen corresponding path program 1 times [2024-10-11 13:00:50,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:00:50,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949483520] [2024-10-11 13:00:50,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:00:50,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:00:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:00:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:00:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:00:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:00:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:00:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:00:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:00:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:00:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:00:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 13:00:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:00:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:00:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:00:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 13:00:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 13:00:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 13:00:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 13:00:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:00:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:00:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 13:00:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 13:00:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 13:00:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 13:00:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:00:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:00:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 13:00:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:56,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 13:00:56,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:00:56,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949483520] [2024-10-11 13:00:56,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949483520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:00:56,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:00:56,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:00:56,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028901856] [2024-10-11 13:00:56,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:00:56,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:00:56,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:00:56,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:00:56,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:00:56,306 INFO L87 Difference]: Start difference. First operand 174 states and 262 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 13:00:57,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:00:57,024 INFO L93 Difference]: Finished difference Result 345 states and 506 transitions. [2024-10-11 13:00:57,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:00:57,024 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2024-10-11 13:00:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:00:57,025 INFO L225 Difference]: With dead ends: 345 [2024-10-11 13:00:57,026 INFO L226 Difference]: Without dead ends: 247 [2024-10-11 13:00:57,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:00:57,026 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 168 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:00:57,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 491 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:00:57,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-11 13:00:57,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 173. [2024-10-11 13:00:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 116 states have (on average 1.3448275862068966) internal successors, (156), 116 states have internal predecessors, (156), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 13:00:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 260 transitions. [2024-10-11 13:00:57,042 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 260 transitions. Word has length 160 [2024-10-11 13:00:57,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:00:57,042 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 260 transitions. [2024-10-11 13:00:57,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 13:00:57,043 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 260 transitions. [2024-10-11 13:00:57,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 13:00:57,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:00:57,043 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:00:57,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 13:00:57,044 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:00:57,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:00:57,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1103171344, now seen corresponding path program 1 times [2024-10-11 13:00:57,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:00:57,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654514143] [2024-10-11 13:00:57,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:00:57,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:00:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:01:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:01:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:01:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:01:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:01:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:01:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:01:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:01:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:01:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 13:01:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:01:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:01:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:01:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 13:01:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 13:01:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 13:01:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 13:01:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:01:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:01:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 13:01:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 13:01:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 13:01:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 13:01:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:01:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:01:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 13:01:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:02,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 13:01:02,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:01:02,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654514143] [2024-10-11 13:01:02,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654514143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:01:02,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:01:02,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:01:02,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080112284] [2024-10-11 13:01:02,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:01:02,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:01:02,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:01:02,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:01:02,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:01:02,267 INFO L87 Difference]: Start difference. First operand 173 states and 260 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 13:01:04,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:01:04,716 INFO L93 Difference]: Finished difference Result 399 states and 575 transitions. [2024-10-11 13:01:04,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 13:01:04,716 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2024-10-11 13:01:04,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:01:04,718 INFO L225 Difference]: With dead ends: 399 [2024-10-11 13:01:04,718 INFO L226 Difference]: Without dead ends: 301 [2024-10-11 13:01:04,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-10-11 13:01:04,719 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 180 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:01:04,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 533 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 13:01:04,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-11 13:01:04,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 173. [2024-10-11 13:01:04,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 116 states have (on average 1.3448275862068966) internal successors, (156), 116 states have internal predecessors, (156), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 13:01:04,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 260 transitions. [2024-10-11 13:01:04,734 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 260 transitions. Word has length 160 [2024-10-11 13:01:04,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:01:04,734 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 260 transitions. [2024-10-11 13:01:04,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 13:01:04,734 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 260 transitions. [2024-10-11 13:01:04,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 13:01:04,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:01:04,735 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:01:04,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 13:01:04,735 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:01:04,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:01:04,736 INFO L85 PathProgramCache]: Analyzing trace with hash 710144334, now seen corresponding path program 1 times [2024-10-11 13:01:04,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:01:04,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900628569] [2024-10-11 13:01:04,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:01:04,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:01:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat