./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-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-34.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6879d183ea614705b8dec9095f843a55526481f961ca46c6ec00dfff8309d4ce --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:34:47,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:34:47,846 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:34:47,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:34:47,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:34:47,884 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:34:47,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:34:47,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:34:47,888 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:34:47,889 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:34:47,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:34:47,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:34:47,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:34:47,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:34:47,893 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:34:47,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:34:47,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:34:47,894 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:34:47,894 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:34:47,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:34:47,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:34:47,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:34:47,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:34:47,900 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:34:47,900 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:34:47,900 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:34:47,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:34:47,901 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:34:47,901 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:34:47,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:34:47,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:34:47,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:34:47,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:34:47,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:34:47,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:34:47,904 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:34:47,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:34:47,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:34:47,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:34:47,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:34:47,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:34:47,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:34:47,905 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6879d183ea614705b8dec9095f843a55526481f961ca46c6ec00dfff8309d4ce [2024-10-13 05:34:48,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:34:48,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:34:48,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:34:48,194 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:34:48,195 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:34:48,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-34.i [2024-10-13 05:34:49,680 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:34:49,899 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:34:49,899 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-34.i [2024-10-13 05:34:49,910 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85a3c24d0/1138e58d583d46fbafe6d2c00934ebe7/FLAGfca6a0f75 [2024-10-13 05:34:49,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85a3c24d0/1138e58d583d46fbafe6d2c00934ebe7 [2024-10-13 05:34:49,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:34:49,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:34:49,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:34:49,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:34:49,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:34:49,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:34:49" (1/1) ... [2024-10-13 05:34:49,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bef941a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:34:49, skipping insertion in model container [2024-10-13 05:34:49,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:34:49" (1/1) ... [2024-10-13 05:34:49,968 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:34:50,157 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-34.i[915,928] [2024-10-13 05:34:50,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:34:50,238 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:34:50,273 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-34.i[915,928] [2024-10-13 05:34:50,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:34:50,370 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:34:50,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:34:50 WrapperNode [2024-10-13 05:34:50,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:34:50,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:34:50,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:34:50,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:34:50,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:34:50" (1/1) ... [2024-10-13 05:34:50,389 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:34:50" (1/1) ... [2024-10-13 05:34:50,433 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2024-10-13 05:34:50,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:34:50,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:34:50,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:34:50,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:34:50,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:34:50" (1/1) ... [2024-10-13 05:34:50,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:34:50" (1/1) ... [2024-10-13 05:34:50,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:34:50" (1/1) ... [2024-10-13 05:34:50,484 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 05:34:50,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:34:50" (1/1) ... [2024-10-13 05:34:50,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:34:50" (1/1) ... [2024-10-13 05:34:50,493 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:34:50" (1/1) ... [2024-10-13 05:34:50,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:34:50" (1/1) ... [2024-10-13 05:34:50,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:34:50" (1/1) ... [2024-10-13 05:34:50,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:34:50" (1/1) ... [2024-10-13 05:34:50,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:34:50,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:34:50,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:34:50,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:34:50,509 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:34:50" (1/1) ... [2024-10-13 05:34:50,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:34:50,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:34:50,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 05:34:50,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 05:34:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:34:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:34:50,607 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:34:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:34:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:34:50,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:34:50,698 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:34:50,703 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:34:51,190 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-10-13 05:34:51,191 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:34:51,236 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:34:51,237 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:34:51,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:34:51 BoogieIcfgContainer [2024-10-13 05:34:51,238 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:34:51,240 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:34:51,241 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:34:51,244 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:34:51,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:34:49" (1/3) ... [2024-10-13 05:34:51,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a1f72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:34:51, skipping insertion in model container [2024-10-13 05:34:51,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:34:50" (2/3) ... [2024-10-13 05:34:51,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a1f72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:34:51, skipping insertion in model container [2024-10-13 05:34:51,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:34:51" (3/3) ... [2024-10-13 05:34:51,249 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-34.i [2024-10-13 05:34:51,270 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:34:51,271 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:34:51,353 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:34:51,362 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;@4469ecaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:34:51,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:34:51,369 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 50 states have internal predecessors, (76), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 05:34:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-13 05:34:51,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:34:51,384 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:34:51,384 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:34:51,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:34:51,395 INFO L85 PathProgramCache]: Analyzing trace with hash -100955092, now seen corresponding path program 1 times [2024-10-13 05:34:51,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:34:51,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543520491] [2024-10-13 05:34:51,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:34:51,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:34:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:51,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:34:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:51,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:34:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:51,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:34:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:51,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:34:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:51,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:34:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:51,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:34:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:51,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:34:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:51,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:34:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:51,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:34:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:51,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:34:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:51,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:34:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:51,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:34:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:51,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:34:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:34:51,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:34:51,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543520491] [2024-10-13 05:34:51,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543520491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:34:51,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:34:51,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:34:51,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283889683] [2024-10-13 05:34:51,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:34:51,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:34:51,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:34:51,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:34:51,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:34:51,888 INFO L87 Difference]: Start difference. First operand has 65 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 50 states have internal predecessors, (76), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-13 05:34:51,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:34:51,932 INFO L93 Difference]: Finished difference Result 127 states and 215 transitions. [2024-10-13 05:34:51,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:34:51,937 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90 [2024-10-13 05:34:51,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:34:51,944 INFO L225 Difference]: With dead ends: 127 [2024-10-13 05:34:51,944 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 05:34:51,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:34:51,954 INFO L432 NwaCegarLoop]: 94 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, 94 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:34:51,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:34:51,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 05:34:51,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-13 05:34:51,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 48 states have internal predecessors, (71), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 05:34:51,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 97 transitions. [2024-10-13 05:34:52,000 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 97 transitions. Word has length 90 [2024-10-13 05:34:52,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:34:52,001 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 97 transitions. [2024-10-13 05:34:52,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-13 05:34:52,002 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 97 transitions. [2024-10-13 05:34:52,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-13 05:34:52,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:34:52,007 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:34:52,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:34:52,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:34:52,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:34:52,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1074906774, now seen corresponding path program 1 times [2024-10-13 05:34:52,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:34:52,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165790231] [2024-10-13 05:34:52,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:34:52,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:34:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:52,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:34:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:52,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:34:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:52,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:34:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:52,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:34:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:52,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:34:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:52,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:34:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:52,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:34:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:52,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:34:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:52,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:34:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:52,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:34:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:52,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:34:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:52,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:34:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:52,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:34:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:52,639 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:34:52,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:34:52,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165790231] [2024-10-13 05:34:52,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165790231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:34:52,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:34:52,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:34:52,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246036388] [2024-10-13 05:34:52,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:34:52,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:34:52,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:34:52,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:34:52,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:34:52,648 INFO L87 Difference]: Start difference. First operand 63 states and 97 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:34:52,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:34:52,833 INFO L93 Difference]: Finished difference Result 216 states and 333 transitions. [2024-10-13 05:34:52,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:34:52,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2024-10-13 05:34:52,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:34:52,838 INFO L225 Difference]: With dead ends: 216 [2024-10-13 05:34:52,840 INFO L226 Difference]: Without dead ends: 154 [2024-10-13 05:34:52,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:34:52,843 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 124 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:34:52,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 309 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:34:52,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-13 05:34:52,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 125. [2024-10-13 05:34:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 96 states have (on average 1.46875) internal successors, (141), 96 states have internal predecessors, (141), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 05:34:52,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 193 transitions. [2024-10-13 05:34:52,882 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 193 transitions. Word has length 90 [2024-10-13 05:34:52,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:34:52,886 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 193 transitions. [2024-10-13 05:34:52,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:34:52,887 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 193 transitions. [2024-10-13 05:34:52,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-13 05:34:52,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:34:52,890 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:34:52,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:34:52,891 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:34:52,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:34:52,891 INFO L85 PathProgramCache]: Analyzing trace with hash -238751484, now seen corresponding path program 1 times [2024-10-13 05:34:52,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:34:52,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963364022] [2024-10-13 05:34:52,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:34:52,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:34:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:53,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:34:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:53,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:34:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:53,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:34:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:53,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:34:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:53,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:34:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:53,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:34:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:53,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:34:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:53,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:34:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:53,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:34:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:53,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:34:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:53,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:34:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:53,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:34:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:53,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:34:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:34:53,336 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:34:53,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:34:53,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963364022] [2024-10-13 05:34:53,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963364022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:34:53,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:34:53,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:34:53,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789315902] [2024-10-13 05:34:53,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:34:53,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:34:53,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:34:53,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:34:53,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:34:53,343 INFO L87 Difference]: Start difference. First operand 125 states and 193 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:34:53,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:34:53,599 INFO L93 Difference]: Finished difference Result 368 states and 566 transitions. [2024-10-13 05:34:53,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:34:53,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2024-10-13 05:34:53,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:34:53,602 INFO L225 Difference]: With dead ends: 368 [2024-10-13 05:34:53,602 INFO L226 Difference]: Without dead ends: 244 [2024-10-13 05:34:53,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:34:53,605 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 153 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:34:53,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 290 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:34:53,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-13 05:34:53,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 129. [2024-10-13 05:34:53,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 100 states have (on average 1.45) internal successors, (145), 100 states have internal predecessors, (145), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 05:34:53,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 197 transitions. [2024-10-13 05:34:53,639 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 197 transitions. Word has length 91 [2024-10-13 05:34:53,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:34:53,640 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 197 transitions. [2024-10-13 05:34:53,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:34:53,642 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 197 transitions. [2024-10-13 05:34:53,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-13 05:34:53,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:34:53,644 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:34:53,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 05:34:53,647 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:34:53,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:34:53,648 INFO L85 PathProgramCache]: Analyzing trace with hash 635638786, now seen corresponding path program 1 times [2024-10-13 05:34:53,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:34:53,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278240136] [2024-10-13 05:34:53,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:34:53,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:34:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:00,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:35:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:00,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:35:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:00,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:35:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:00,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:35:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:00,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:35:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:00,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:35:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:00,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:35:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:00,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:35:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:00,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:35:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:00,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:35:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:00,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:35:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:00,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:35:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:00,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:35:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:00,996 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:35:00,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:35:00,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278240136] [2024-10-13 05:35:00,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278240136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:35:00,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:35:00,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 05:35:00,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090087291] [2024-10-13 05:35:01,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:35:01,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 05:35:01,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:35:01,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 05:35:01,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-13 05:35:01,002 INFO L87 Difference]: Start difference. First operand 129 states and 197 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:35:04,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:35:04,363 INFO L93 Difference]: Finished difference Result 465 states and 697 transitions. [2024-10-13 05:35:04,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 05:35:04,364 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-10-13 05:35:04,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:35:04,366 INFO L225 Difference]: With dead ends: 465 [2024-10-13 05:35:04,366 INFO L226 Difference]: Without dead ends: 337 [2024-10-13 05:35:04,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2024-10-13 05:35:04,369 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 347 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 05:35:04,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 496 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 05:35:04,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-13 05:35:04,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 187. [2024-10-13 05:35:04,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 144 states have (on average 1.4236111111111112) internal successors, (205), 144 states have internal predecessors, (205), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 05:35:04,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 283 transitions. [2024-10-13 05:35:04,399 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 283 transitions. Word has length 92 [2024-10-13 05:35:04,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:35:04,400 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 283 transitions. [2024-10-13 05:35:04,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:35:04,400 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 283 transitions. [2024-10-13 05:35:04,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-13 05:35:04,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:35:04,402 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:35:04,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 05:35:04,402 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:35:04,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:35:04,403 INFO L85 PathProgramCache]: Analyzing trace with hash 692897088, now seen corresponding path program 1 times [2024-10-13 05:35:04,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:35:04,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333144954] [2024-10-13 05:35:04,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:35:04,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:35:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:06,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:35:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:06,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:35:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:06,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:35:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:06,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:35:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:06,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:35:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:06,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:35:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:06,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:35:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:06,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:35:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:06,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:35:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:06,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:35:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:06,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:35:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:06,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:35:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:06,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:35:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:06,620 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:35:06,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:35:06,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333144954] [2024-10-13 05:35:06,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333144954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:35:06,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:35:06,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:35:06,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267652746] [2024-10-13 05:35:06,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:35:06,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:35:06,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:35:06,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:35:06,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:35:06,622 INFO L87 Difference]: Start difference. First operand 187 states and 283 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:35:07,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:35:07,444 INFO L93 Difference]: Finished difference Result 500 states and 751 transitions. [2024-10-13 05:35:07,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:35:07,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-10-13 05:35:07,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:35:07,448 INFO L225 Difference]: With dead ends: 500 [2024-10-13 05:35:07,448 INFO L226 Difference]: Without dead ends: 372 [2024-10-13 05:35:07,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 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-13 05:35:07,449 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 317 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 05:35:07,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 352 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 05:35:07,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-10-13 05:35:07,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 228. [2024-10-13 05:35:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 185 states have (on average 1.4378378378378378) internal successors, (266), 185 states have internal predecessors, (266), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 05:35:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 344 transitions. [2024-10-13 05:35:07,479 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 344 transitions. Word has length 92 [2024-10-13 05:35:07,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:35:07,480 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 344 transitions. [2024-10-13 05:35:07,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:35:07,483 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 344 transitions. [2024-10-13 05:35:07,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-13 05:35:07,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:35:07,484 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:35:07,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 05:35:07,485 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:35:07,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:35:07,485 INFO L85 PathProgramCache]: Analyzing trace with hash -173707840, now seen corresponding path program 1 times [2024-10-13 05:35:07,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:35:07,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350631571] [2024-10-13 05:35:07,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:35:07,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:35:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:09,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:35:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:09,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:35:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:09,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:35:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:09,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:35:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:09,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:35:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:09,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:35:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:09,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:35:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:09,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:35:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:09,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:35:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:09,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:35:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:09,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:35:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:09,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:35:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:09,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:35:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:09,955 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:35:09,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:35:09,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350631571] [2024-10-13 05:35:09,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350631571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:35:09,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:35:09,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:35:09,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384629399] [2024-10-13 05:35:09,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:35:09,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:35:09,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:35:09,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:35:09,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:35:09,959 INFO L87 Difference]: Start difference. First operand 228 states and 344 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:35:10,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:35:10,942 INFO L93 Difference]: Finished difference Result 572 states and 848 transitions. [2024-10-13 05:35:10,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:35:10,943 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-10-13 05:35:10,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:35:10,946 INFO L225 Difference]: With dead ends: 572 [2024-10-13 05:35:10,946 INFO L226 Difference]: Without dead ends: 401 [2024-10-13 05:35:10,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:35:10,949 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 268 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 05:35:10,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 327 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 05:35:10,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-13 05:35:10,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 331. [2024-10-13 05:35:10,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 288 states have (on average 1.4409722222222223) internal successors, (415), 288 states have internal predecessors, (415), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 05:35:10,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 493 transitions. [2024-10-13 05:35:10,982 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 493 transitions. Word has length 92 [2024-10-13 05:35:10,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:35:10,982 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 493 transitions. [2024-10-13 05:35:10,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:35:10,982 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 493 transitions. [2024-10-13 05:35:10,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-13 05:35:10,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:35:10,986 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:35:10,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 05:35:10,987 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:35:10,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:35:10,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2037732559, now seen corresponding path program 1 times [2024-10-13 05:35:10,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:35:10,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503557867] [2024-10-13 05:35:10,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:35:10,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:35:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:35:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:35:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:35:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:35:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:35:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:35:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:35:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:35:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:35:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:35:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:35:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:35:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:35:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,198 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:35:12,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:35:12,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503557867] [2024-10-13 05:35:12,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503557867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:35:12,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:35:12,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:35:12,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374832813] [2024-10-13 05:35:12,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:35:12,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:35:12,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:35:12,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:35:12,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:35:12,200 INFO L87 Difference]: Start difference. First operand 331 states and 493 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:35:12,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:35:12,661 INFO L93 Difference]: Finished difference Result 597 states and 885 transitions. [2024-10-13 05:35:12,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 05:35:12,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-10-13 05:35:12,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:35:12,664 INFO L225 Difference]: With dead ends: 597 [2024-10-13 05:35:12,664 INFO L226 Difference]: Without dead ends: 423 [2024-10-13 05:35:12,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:35:12,666 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 157 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:35:12,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 316 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:35:12,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-10-13 05:35:12,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 333. [2024-10-13 05:35:12,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 290 states have (on average 1.4241379310344828) internal successors, (413), 290 states have internal predecessors, (413), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 05:35:12,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 491 transitions. [2024-10-13 05:35:12,696 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 491 transitions. Word has length 92 [2024-10-13 05:35:12,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:35:12,697 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 491 transitions. [2024-10-13 05:35:12,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:35:12,698 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 491 transitions. [2024-10-13 05:35:12,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-13 05:35:12,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:35:12,702 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:35:12,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 05:35:12,702 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:35:12,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:35:12,703 INFO L85 PathProgramCache]: Analyzing trace with hash 48832772, now seen corresponding path program 1 times [2024-10-13 05:35:12,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:35:12,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185204628] [2024-10-13 05:35:12,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:35:12,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:35:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:35:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:35:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:35:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:35:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:35:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:35:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:35:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:35:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:35:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:35:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:12,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:35:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:13,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:35:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:13,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:35:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:13,012 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:35:13,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:35:13,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185204628] [2024-10-13 05:35:13,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185204628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:35:13,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:35:13,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:35:13,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139255408] [2024-10-13 05:35:13,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:35:13,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:35:13,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:35:13,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:35:13,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:35:13,014 INFO L87 Difference]: Start difference. First operand 333 states and 491 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:35:13,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:35:13,211 INFO L93 Difference]: Finished difference Result 515 states and 766 transitions. [2024-10-13 05:35:13,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:35:13,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-10-13 05:35:13,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:35:13,214 INFO L225 Difference]: With dead ends: 515 [2024-10-13 05:35:13,214 INFO L226 Difference]: Without dead ends: 327 [2024-10-13 05:35:13,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:35:13,216 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 77 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:35:13,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 219 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:35:13,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-13 05:35:13,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 301. [2024-10-13 05:35:13,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 258 states have (on average 1.3914728682170543) internal successors, (359), 258 states have internal predecessors, (359), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 05:35:13,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 437 transitions. [2024-10-13 05:35:13,244 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 437 transitions. Word has length 92 [2024-10-13 05:35:13,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:35:13,247 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 437 transitions. [2024-10-13 05:35:13,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:35:13,247 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 437 transitions. [2024-10-13 05:35:13,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 05:35:13,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:35:13,248 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:35:13,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 05:35:13,249 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:35:13,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:35:13,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1114190223, now seen corresponding path program 1 times [2024-10-13 05:35:13,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:35:13,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849716647] [2024-10-13 05:35:13,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:35:13,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:35:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:16,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:35:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:16,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:35:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:16,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:35:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:16,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:35:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:16,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:35:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:16,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:35:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:16,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:35:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:16,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:35:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:16,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:35:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:16,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:35:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:16,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:35:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:16,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:35:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:16,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:35:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:16,240 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:35:16,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:35:16,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849716647] [2024-10-13 05:35:16,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849716647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:35:16,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:35:16,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 05:35:16,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10815474] [2024-10-13 05:35:16,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:35:16,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 05:35:16,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:35:16,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 05:35:16,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:35:16,242 INFO L87 Difference]: Start difference. First operand 301 states and 437 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:35:17,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:35:17,794 INFO L93 Difference]: Finished difference Result 607 states and 878 transitions. [2024-10-13 05:35:17,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 05:35:17,795 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-10-13 05:35:17,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:35:17,798 INFO L225 Difference]: With dead ends: 607 [2024-10-13 05:35:17,798 INFO L226 Difference]: Without dead ends: 479 [2024-10-13 05:35:17,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-13 05:35:17,800 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 208 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 05:35:17,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 581 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 05:35:17,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-10-13 05:35:17,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 317. [2024-10-13 05:35:17,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 272 states have (on average 1.3786764705882353) internal successors, (375), 272 states have internal predecessors, (375), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 05:35:17,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 453 transitions. [2024-10-13 05:35:17,831 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 453 transitions. Word has length 93 [2024-10-13 05:35:17,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:35:17,831 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 453 transitions. [2024-10-13 05:35:17,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:35:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 453 transitions. [2024-10-13 05:35:17,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 05:35:17,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:35:17,834 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:35:17,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 05:35:17,835 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:35:17,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:35:17,835 INFO L85 PathProgramCache]: Analyzing trace with hash -969020839, now seen corresponding path program 1 times [2024-10-13 05:35:17,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:35:17,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538947254] [2024-10-13 05:35:17,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:35:17,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:35:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:20,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:35:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:20,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:35:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:20,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:35:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:20,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:35:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:20,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:35:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:20,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:35:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:20,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:35:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:20,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:35:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:20,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:35:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:20,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:35:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:20,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:35:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:20,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:35:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:20,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:35:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:35:20,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:35:20,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538947254] [2024-10-13 05:35:20,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538947254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:35:20,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:35:20,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 05:35:20,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065941829] [2024-10-13 05:35:20,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:35:20,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 05:35:20,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:35:20,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 05:35:20,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:35:20,920 INFO L87 Difference]: Start difference. First operand 317 states and 453 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:35:22,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:35:22,760 INFO L93 Difference]: Finished difference Result 802 states and 1147 transitions. [2024-10-13 05:35:22,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 05:35:22,761 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-10-13 05:35:22,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:35:22,764 INFO L225 Difference]: With dead ends: 802 [2024-10-13 05:35:22,765 INFO L226 Difference]: Without dead ends: 606 [2024-10-13 05:35:22,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2024-10-13 05:35:22,770 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 283 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 05:35:22,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 462 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 05:35:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-10-13 05:35:22,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 414. [2024-10-13 05:35:22,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 369 states have (on average 1.3983739837398375) internal successors, (516), 369 states have internal predecessors, (516), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 05:35:22,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 594 transitions. [2024-10-13 05:35:22,803 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 594 transitions. Word has length 93 [2024-10-13 05:35:22,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:35:22,806 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 594 transitions. [2024-10-13 05:35:22,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:35:22,807 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 594 transitions. [2024-10-13 05:35:22,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 05:35:22,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:35:22,809 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:35:22,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 05:35:22,809 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:35:22,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:35:22,809 INFO L85 PathProgramCache]: Analyzing trace with hash -372841257, now seen corresponding path program 1 times [2024-10-13 05:35:22,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:35:22,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624446086] [2024-10-13 05:35:22,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:35:22,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:35:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:26,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:35:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:26,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:35:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:26,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:35:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:26,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:35:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:26,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:35:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:26,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:35:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:26,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:35:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:26,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:35:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:26,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:35:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:26,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:35:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:26,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:35:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:26,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:35:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:26,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:35:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:26,250 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:35:26,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:35:26,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624446086] [2024-10-13 05:35:26,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624446086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:35:26,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:35:26,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 05:35:26,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999403432] [2024-10-13 05:35:26,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:35:26,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 05:35:26,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:35:26,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 05:35:26,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-13 05:35:26,253 INFO L87 Difference]: Start difference. First operand 414 states and 594 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:35:29,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:35:29,260 INFO L93 Difference]: Finished difference Result 1172 states and 1706 transitions. [2024-10-13 05:35:29,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 05:35:29,261 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-10-13 05:35:29,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:35:29,266 INFO L225 Difference]: With dead ends: 1172 [2024-10-13 05:35:29,266 INFO L226 Difference]: Without dead ends: 958 [2024-10-13 05:35:29,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=248, Invalid=564, Unknown=0, NotChecked=0, Total=812 [2024-10-13 05:35:29,268 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 538 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:35:29,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 510 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 05:35:29,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-10-13 05:35:29,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 648. [2024-10-13 05:35:29,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 573 states have (on average 1.4101221640488657) internal successors, (808), 573 states have internal predecessors, (808), 65 states have call successors, (65), 9 states have call predecessors, (65), 9 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-13 05:35:29,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 938 transitions. [2024-10-13 05:35:29,317 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 938 transitions. Word has length 94 [2024-10-13 05:35:29,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:35:29,317 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 938 transitions. [2024-10-13 05:35:29,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:35:29,317 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 938 transitions. [2024-10-13 05:35:29,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 05:35:29,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:35:29,319 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:35:29,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 05:35:29,319 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:35:29,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:35:29,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1520730717, now seen corresponding path program 1 times [2024-10-13 05:35:29,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:35:29,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546200900] [2024-10-13 05:35:29,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:35:29,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:35:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:33,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:35:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:33,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:35:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:33,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:35:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:33,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:35:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:33,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:35:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:33,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:35:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:33,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:35:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:33,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:35:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:33,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:35:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:33,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:35:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:33,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:35:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:33,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:35:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:33,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:35:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:35:33,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:35:33,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546200900] [2024-10-13 05:35:33,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546200900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:35:33,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:35:33,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 05:35:33,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042791821] [2024-10-13 05:35:33,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:35:33,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 05:35:33,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:35:33,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 05:35:33,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:35:33,110 INFO L87 Difference]: Start difference. First operand 648 states and 938 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:35:37,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:35:37,530 INFO L93 Difference]: Finished difference Result 1508 states and 2180 transitions. [2024-10-13 05:35:37,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 05:35:37,532 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-10-13 05:35:37,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:35:37,538 INFO L225 Difference]: With dead ends: 1508 [2024-10-13 05:35:37,538 INFO L226 Difference]: Without dead ends: 1082 [2024-10-13 05:35:37,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2024-10-13 05:35:37,540 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 351 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:35:37,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 441 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 05:35:37,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2024-10-13 05:35:37,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 690. [2024-10-13 05:35:37,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 615 states have (on average 1.408130081300813) internal successors, (866), 615 states have internal predecessors, (866), 65 states have call successors, (65), 9 states have call predecessors, (65), 9 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-13 05:35:37,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 996 transitions. [2024-10-13 05:35:37,604 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 996 transitions. Word has length 94 [2024-10-13 05:35:37,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:35:37,604 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 996 transitions. [2024-10-13 05:35:37,605 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:35:37,605 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 996 transitions. [2024-10-13 05:35:37,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 05:35:37,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:35:37,606 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:35:37,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 05:35:37,607 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:35:37,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:35:37,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1907631651, now seen corresponding path program 1 times [2024-10-13 05:35:37,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:35:37,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266221957] [2024-10-13 05:35:37,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:35:37,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:35:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:41,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:35:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:41,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:35:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:41,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:35:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:41,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:35:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:41,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:35:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:41,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:35:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:41,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:35:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:41,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:35:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:41,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:35:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:41,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:35:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:41,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:35:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:41,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:35:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:41,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:35:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:35:41,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:35:41,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266221957] [2024-10-13 05:35:41,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266221957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:35:41,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:35:41,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 05:35:41,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773963744] [2024-10-13 05:35:41,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:35:41,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 05:35:41,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:35:41,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 05:35:41,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:35:41,507 INFO L87 Difference]: Start difference. First operand 690 states and 996 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:35:43,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:35:43,865 INFO L93 Difference]: Finished difference Result 1502 states and 2159 transitions. [2024-10-13 05:35:43,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 05:35:43,866 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-10-13 05:35:43,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:35:43,871 INFO L225 Difference]: With dead ends: 1502 [2024-10-13 05:35:43,872 INFO L226 Difference]: Without dead ends: 959 [2024-10-13 05:35:43,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-10-13 05:35:43,874 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 216 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:35:43,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 549 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 05:35:43,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2024-10-13 05:35:43,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 690. [2024-10-13 05:35:43,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 615 states have (on average 1.4065040650406504) internal successors, (865), 615 states have internal predecessors, (865), 65 states have call successors, (65), 9 states have call predecessors, (65), 9 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-13 05:35:43,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 995 transitions. [2024-10-13 05:35:43,927 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 995 transitions. Word has length 94 [2024-10-13 05:35:43,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:35:43,928 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 995 transitions. [2024-10-13 05:35:43,928 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:35:43,928 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 995 transitions. [2024-10-13 05:35:43,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-13 05:35:43,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:35:43,929 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:35:43,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 05:35:43,930 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:35:43,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:35:43,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1964889953, now seen corresponding path program 1 times [2024-10-13 05:35:43,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:35:43,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28690403] [2024-10-13 05:35:43,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:35:43,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:35:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:50,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:35:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:50,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:35:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:50,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 05:35:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:50,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:35:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:50,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:35:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:50,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:35:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:50,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 05:35:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:50,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:35:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:50,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 05:35:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:50,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:35:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:51,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:35:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:51,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:35:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:51,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 05:35:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:35:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 05:35:51,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:35:51,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28690403] [2024-10-13 05:35:51,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28690403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:35:51,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:35:51,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 05:35:51,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921405360] [2024-10-13 05:35:51,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:35:51,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 05:35:51,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:35:51,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 05:35:51,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:35:51,041 INFO L87 Difference]: Start difference. First operand 690 states and 995 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:35:54,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:35:54,372 INFO L93 Difference]: Finished difference Result 1364 states and 1944 transitions. [2024-10-13 05:35:54,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 05:35:54,373 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-10-13 05:35:54,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:35:54,378 INFO L225 Difference]: With dead ends: 1364 [2024-10-13 05:35:54,378 INFO L226 Difference]: Without dead ends: 898 [2024-10-13 05:35:54,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=161, Invalid=541, Unknown=0, NotChecked=0, Total=702 [2024-10-13 05:35:54,380 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 339 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:35:54,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 494 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 05:35:54,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-10-13 05:35:54,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 726. [2024-10-13 05:35:54,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 651 states have (on average 1.3978494623655915) internal successors, (910), 651 states have internal predecessors, (910), 65 states have call successors, (65), 9 states have call predecessors, (65), 9 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-13 05:35:54,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1040 transitions. [2024-10-13 05:35:54,436 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1040 transitions. Word has length 94 [2024-10-13 05:35:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:35:54,437 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 1040 transitions. [2024-10-13 05:35:54,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 05:35:54,437 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1040 transitions. [2024-10-13 05:35:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-13 05:35:54,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:35:54,438 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:35:54,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 05:35:54,439 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:35:54,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:35:54,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1330888373, now seen corresponding path program 1 times [2024-10-13 05:35:54,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:35:54,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420624756] [2024-10-13 05:35:54,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:35:54,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:35:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat