./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_variablewrapping_wrapper-sp_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 645cc8cd2ca5c3df18e88a30b2b1ec0d9c7b704a87e37ccd990a4988acc7530a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:04:17,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:04:17,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:04:17,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:04:17,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:04:17,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:04:17,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:04:17,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:04:17,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:04:17,793 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:04:17,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:04:17,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:04:17,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:04:17,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:04:17,804 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:04:17,805 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:04:17,805 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:04:17,805 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:04:17,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:04:17,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:04:17,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:04:17,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:04:17,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:04:17,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:04:17,811 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:04:17,811 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:04:17,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:04:17,812 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:04:17,812 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:04:17,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:04:17,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:04:17,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:04:17,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:04:17,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:04:17,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:04:17,814 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:04:17,814 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:04:17,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:04:17,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:04:17,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:04:17,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:04:17,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:04:17,818 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 645cc8cd2ca5c3df18e88a30b2b1ec0d9c7b704a87e37ccd990a4988acc7530a [2024-10-11 14:04:18,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:04:18,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:04:18,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:04:18,124 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:04:18,124 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:04:18,125 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i [2024-10-11 14:04:19,586 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:04:19,808 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:04:19,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i [2024-10-11 14:04:19,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/462330a06/1b5956260fd04dad87556bb818daa5ae/FLAG066eb6d1e [2024-10-11 14:04:19,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/462330a06/1b5956260fd04dad87556bb818daa5ae [2024-10-11 14:04:19,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:04:19,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:04:19,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:04:19,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:04:19,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:04:19,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:04:19" (1/1) ... [2024-10-11 14:04:19,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6158f8c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:19, skipping insertion in model container [2024-10-11 14:04:19,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:04:19" (1/1) ... [2024-10-11 14:04:19,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:04:20,062 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_variablewrapping_wrapper-sp_file-84.i[917,930] [2024-10-11 14:04:20,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:04:20,144 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:04:20,158 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_variablewrapping_wrapper-sp_file-84.i[917,930] [2024-10-11 14:04:20,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:04:20,211 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:04:20,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:20 WrapperNode [2024-10-11 14:04:20,212 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:04:20,213 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:04:20,213 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:04:20,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:04:20,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:20" (1/1) ... [2024-10-11 14:04:20,233 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:20" (1/1) ... [2024-10-11 14:04:20,277 INFO L138 Inliner]: procedures = 29, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 437 [2024-10-11 14:04:20,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:04:20,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:04:20,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:04:20,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:04:20,290 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:20" (1/1) ... [2024-10-11 14:04:20,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:20" (1/1) ... [2024-10-11 14:04:20,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:20" (1/1) ... [2024-10-11 14:04:20,325 INFO L175 MemorySlicer]: Split 122 memory accesses to 2 slices as follows [2, 120]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 17 writes are split as follows [0, 17]. [2024-10-11 14:04:20,325 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:20" (1/1) ... [2024-10-11 14:04:20,325 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:20" (1/1) ... [2024-10-11 14:04:20,348 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:20" (1/1) ... [2024-10-11 14:04:20,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:20" (1/1) ... [2024-10-11 14:04:20,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:20" (1/1) ... [2024-10-11 14:04:20,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:20" (1/1) ... [2024-10-11 14:04:20,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:04:20,379 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:04:20,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:04:20,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:04:20,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:20" (1/1) ... [2024-10-11 14:04:20,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:04:20,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:04:20,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:04:20,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:04:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:04:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 14:04:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 14:04:20,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:04:20,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:04:20,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 14:04:20,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 14:04:20,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:04:20,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:04:20,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 14:04:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 14:04:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:04:20,460 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:04:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:04:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:04:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:04:20,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:04:20,572 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:04:20,574 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:04:21,103 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-10-11 14:04:21,104 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:04:21,149 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:04:21,149 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 14:04:21,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:04:21 BoogieIcfgContainer [2024-10-11 14:04:21,150 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:04:21,153 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:04:21,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:04:21,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:04:21,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:04:19" (1/3) ... [2024-10-11 14:04:21,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf0c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:04:21, skipping insertion in model container [2024-10-11 14:04:21,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:04:20" (2/3) ... [2024-10-11 14:04:21,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf0c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:04:21, skipping insertion in model container [2024-10-11 14:04:21,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:04:21" (3/3) ... [2024-10-11 14:04:21,161 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-84.i [2024-10-11 14:04:21,193 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:04:21,194 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:04:21,273 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:04:21,280 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;@704899c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:04:21,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:04:21,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 14:04:21,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 14:04:21,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:21,303 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:21,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:21,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:21,309 INFO L85 PathProgramCache]: Analyzing trace with hash -2037949046, now seen corresponding path program 1 times [2024-10-11 14:04:21,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:21,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307177316] [2024-10-11 14:04:21,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:21,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:21,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:21,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:21,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:21,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:21,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:21,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:21,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:21,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:21,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:21,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:21,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:21,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:21,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:21,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:21,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:21,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:04:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:21,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:04:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:21,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:04:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:21,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:04:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:21,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 14:04:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:21,741 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 14:04:21,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:21,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307177316] [2024-10-11 14:04:21,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307177316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:21,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:21,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:04:21,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433989890] [2024-10-11 14:04:21,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:21,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:04:21,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:21,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:04:21,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:04:21,784 INFO L87 Difference]: Start difference. First operand has 96 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 14:04:21,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:21,835 INFO L93 Difference]: Finished difference Result 189 states and 300 transitions. [2024-10-11 14:04:21,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:04:21,837 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 145 [2024-10-11 14:04:21,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:21,845 INFO L225 Difference]: With dead ends: 189 [2024-10-11 14:04:21,845 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 14:04:21,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:04:21,851 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:21,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:04:21,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 14:04:21,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-11 14:04:21,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 14:04:21,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-10-11 14:04:21,906 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 145 [2024-10-11 14:04:21,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:21,907 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-10-11 14:04:21,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 14:04:21,910 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-10-11 14:04:21,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 14:04:21,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:21,916 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:21,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:04:21,916 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:21,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:21,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1859365614, now seen corresponding path program 1 times [2024-10-11 14:04:21,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:21,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611059582] [2024-10-11 14:04:21,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:21,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:04:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:04:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:04:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:04:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 14:04:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 14:04:22,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:22,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611059582] [2024-10-11 14:04:22,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611059582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:22,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:22,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:04:22,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916541289] [2024-10-11 14:04:22,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:22,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:04:22,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:22,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:04:22,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:04:22,365 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 14:04:22,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:22,423 INFO L93 Difference]: Finished difference Result 190 states and 275 transitions. [2024-10-11 14:04:22,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:04:22,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-10-11 14:04:22,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:22,427 INFO L225 Difference]: With dead ends: 190 [2024-10-11 14:04:22,428 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 14:04:22,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:04:22,432 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:22,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 383 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:04:22,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 14:04:22,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-10-11 14:04:22,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 74 states have internal predecessors, (98), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 14:04:22,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-10-11 14:04:22,454 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 145 [2024-10-11 14:04:22,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:22,456 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-10-11 14:04:22,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 14:04:22,457 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-10-11 14:04:22,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 14:04:22,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:22,459 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:22,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:04:22,462 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:22,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:22,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1859425196, now seen corresponding path program 1 times [2024-10-11 14:04:22,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:22,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18626292] [2024-10-11 14:04:22,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:22,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:04:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:04:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:04:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:04:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 14:04:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:22,930 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 14:04:22,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:22,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18626292] [2024-10-11 14:04:22,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18626292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:22,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:22,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:04:22,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504478405] [2024-10-11 14:04:22,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:22,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:04:22,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:22,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:04:22,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:04:22,935 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 14:04:23,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:23,339 INFO L93 Difference]: Finished difference Result 281 states and 404 transitions. [2024-10-11 14:04:23,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:04:23,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-10-11 14:04:23,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:23,342 INFO L225 Difference]: With dead ends: 281 [2024-10-11 14:04:23,342 INFO L226 Difference]: Without dead ends: 186 [2024-10-11 14:04:23,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:04:23,343 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 101 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:23,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 351 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 14:04:23,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-11 14:04:23,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 162. [2024-10-11 14:04:23,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 119 states have (on average 1.2857142857142858) internal successors, (153), 119 states have internal predecessors, (153), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 14:04:23,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 233 transitions. [2024-10-11 14:04:23,384 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 233 transitions. Word has length 145 [2024-10-11 14:04:23,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:23,385 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 233 transitions. [2024-10-11 14:04:23,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 14:04:23,385 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 233 transitions. [2024-10-11 14:04:23,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 14:04:23,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:23,391 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:23,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:04:23,392 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:23,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:23,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2085711054, now seen corresponding path program 1 times [2024-10-11 14:04:23,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:23,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479350744] [2024-10-11 14:04:23,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:23,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:29,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:29,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:29,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:29,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:29,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:29,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:29,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:29,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:29,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:29,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:29,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:29,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:29,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:29,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:29,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:29,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:04:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:29,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:04:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:29,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:04:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:29,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:04:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:29,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 14:04:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 14:04:29,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:29,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479350744] [2024-10-11 14:04:29,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479350744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:29,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:29,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-11 14:04:29,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004218309] [2024-10-11 14:04:29,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:29,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 14:04:29,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:29,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 14:04:29,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-10-11 14:04:29,991 INFO L87 Difference]: Start difference. First operand 162 states and 233 transitions. Second operand has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 14:04:33,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:33,094 INFO L93 Difference]: Finished difference Result 384 states and 546 transitions. [2024-10-11 14:04:33,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 14:04:33,095 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 153 [2024-10-11 14:04:33,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:33,098 INFO L225 Difference]: With dead ends: 384 [2024-10-11 14:04:33,098 INFO L226 Difference]: Without dead ends: 289 [2024-10-11 14:04:33,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2024-10-11 14:04:33,103 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 489 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:33,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 919 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 14:04:33,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-11 14:04:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 186. [2024-10-11 14:04:33,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 143 states have (on average 1.3006993006993006) internal successors, (186), 143 states have internal predecessors, (186), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 14:04:33,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 266 transitions. [2024-10-11 14:04:33,155 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 266 transitions. Word has length 153 [2024-10-11 14:04:33,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:33,158 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 266 transitions. [2024-10-11 14:04:33,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 14:04:33,159 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 266 transitions. [2024-10-11 14:04:33,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 14:04:33,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:33,163 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:33,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:04:33,163 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:33,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:33,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1268062604, now seen corresponding path program 1 times [2024-10-11 14:04:33,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:33,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870575817] [2024-10-11 14:04:33,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:33,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:37,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:37,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:37,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:37,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:37,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:37,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:37,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:37,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:37,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:37,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:37,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:37,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:37,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:37,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:37,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:37,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:04:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:37,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:04:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:37,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:04:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:37,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:04:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:37,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 14:04:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:37,853 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 14:04:37,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:37,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870575817] [2024-10-11 14:04:37,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870575817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:37,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:37,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-11 14:04:37,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902130130] [2024-10-11 14:04:37,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:37,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 14:04:37,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:37,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 14:04:37,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-10-11 14:04:37,858 INFO L87 Difference]: Start difference. First operand 186 states and 266 transitions. Second operand has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 14:04:39,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:39,598 INFO L93 Difference]: Finished difference Result 339 states and 484 transitions. [2024-10-11 14:04:39,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 14:04:39,599 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 153 [2024-10-11 14:04:39,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:39,601 INFO L225 Difference]: With dead ends: 339 [2024-10-11 14:04:39,601 INFO L226 Difference]: Without dead ends: 229 [2024-10-11 14:04:39,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2024-10-11 14:04:39,603 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 382 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:39,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 628 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 14:04:39,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-11 14:04:39,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 188. [2024-10-11 14:04:39,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 145 states have (on average 1.3103448275862069) internal successors, (190), 145 states have internal predecessors, (190), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 14:04:39,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 270 transitions. [2024-10-11 14:04:39,633 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 270 transitions. Word has length 153 [2024-10-11 14:04:39,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:39,633 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 270 transitions. [2024-10-11 14:04:39,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 14:04:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 270 transitions. [2024-10-11 14:04:39,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 14:04:39,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:39,635 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:39,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:04:39,636 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:39,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:39,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2105566481, now seen corresponding path program 1 times [2024-10-11 14:04:39,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:39,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242478758] [2024-10-11 14:04:39,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:39,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:45,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:45,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:45,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:45,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:45,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:45,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:45,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:45,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:45,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:45,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:45,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:45,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:45,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:45,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:45,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:45,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:04:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:46,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:04:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:46,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:04:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:46,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:04:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:46,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 14:04:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:46,088 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 14:04:46,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:46,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242478758] [2024-10-11 14:04:46,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242478758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:46,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:46,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-11 14:04:46,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608194601] [2024-10-11 14:04:46,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:46,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 14:04:46,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:46,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 14:04:46,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-10-11 14:04:46,091 INFO L87 Difference]: Start difference. First operand 188 states and 270 transitions. Second operand has 20 states, 19 states have (on average 3.0) internal successors, (57), 20 states have internal predecessors, (57), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 14:04:48,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:48,303 INFO L93 Difference]: Finished difference Result 336 states and 480 transitions. [2024-10-11 14:04:48,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 14:04:48,303 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.0) internal successors, (57), 20 states have internal predecessors, (57), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 154 [2024-10-11 14:04:48,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:48,305 INFO L225 Difference]: With dead ends: 336 [2024-10-11 14:04:48,305 INFO L226 Difference]: Without dead ends: 225 [2024-10-11 14:04:48,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=165, Invalid=827, Unknown=0, NotChecked=0, Total=992 [2024-10-11 14:04:48,307 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 283 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:48,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 713 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 14:04:48,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-11 14:04:48,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 188. [2024-10-11 14:04:48,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 145 states have (on average 1.3103448275862069) internal successors, (190), 145 states have internal predecessors, (190), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 14:04:48,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 270 transitions. [2024-10-11 14:04:48,352 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 270 transitions. Word has length 154 [2024-10-11 14:04:48,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:48,354 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 270 transitions. [2024-10-11 14:04:48,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.0) internal successors, (57), 20 states have internal predecessors, (57), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 14:04:48,354 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 270 transitions. [2024-10-11 14:04:48,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 14:04:48,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:48,358 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:48,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:04:48,358 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:48,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:48,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1718729431, now seen corresponding path program 1 times [2024-10-11 14:04:48,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:48,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369936557] [2024-10-11 14:04:48,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:48,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:04:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:04:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:04:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:04:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 14:04:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:50,411 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 14:04:50,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:50,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369936557] [2024-10-11 14:04:50,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369936557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:50,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:50,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 14:04:50,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930411754] [2024-10-11 14:04:50,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:50,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 14:04:50,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:50,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 14:04:50,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:04:50,415 INFO L87 Difference]: Start difference. First operand 188 states and 270 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 14:04:51,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:51,410 INFO L93 Difference]: Finished difference Result 359 states and 515 transitions. [2024-10-11 14:04:51,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:04:51,411 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2024-10-11 14:04:51,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:51,412 INFO L225 Difference]: With dead ends: 359 [2024-10-11 14:04:51,412 INFO L226 Difference]: Without dead ends: 248 [2024-10-11 14:04:51,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2024-10-11 14:04:51,414 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 224 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:51,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 405 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 14:04:51,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-10-11 14:04:51,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 219. [2024-10-11 14:04:51,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 176 states have (on average 1.3352272727272727) internal successors, (235), 176 states have internal predecessors, (235), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 14:04:51,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 315 transitions. [2024-10-11 14:04:51,453 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 315 transitions. Word has length 155 [2024-10-11 14:04:51,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:51,453 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 315 transitions. [2024-10-11 14:04:51,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 14:04:51,454 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 315 transitions. [2024-10-11 14:04:51,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 14:04:51,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:51,455 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:51,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:04:51,456 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:51,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:51,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1296374187, now seen corresponding path program 1 times [2024-10-11 14:04:51,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:51,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389892155] [2024-10-11 14:04:51,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:51,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:53,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:53,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:53,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:53,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:53,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:53,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:53,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:53,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:53,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:53,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:53,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:53,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:53,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:53,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:53,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:53,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:04:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:53,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:04:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:53,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:04:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:53,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:04:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:53,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 14:04:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:53,158 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 14:04:53,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:53,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389892155] [2024-10-11 14:04:53,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389892155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:53,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:53,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:04:53,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157638277] [2024-10-11 14:04:53,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:53,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:04:53,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:53,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:04:53,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:04:53,160 INFO L87 Difference]: Start difference. First operand 219 states and 315 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 14:04:53,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:53,901 INFO L93 Difference]: Finished difference Result 400 states and 573 transitions. [2024-10-11 14:04:53,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:04:53,902 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2024-10-11 14:04:53,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:53,904 INFO L225 Difference]: With dead ends: 400 [2024-10-11 14:04:53,904 INFO L226 Difference]: Without dead ends: 272 [2024-10-11 14:04:53,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:04:53,907 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 370 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:53,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 315 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 14:04:53,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-11 14:04:53,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 240. [2024-10-11 14:04:53,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 197 states have (on average 1.3401015228426396) internal successors, (264), 197 states have internal predecessors, (264), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 14:04:53,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 344 transitions. [2024-10-11 14:04:53,949 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 344 transitions. Word has length 155 [2024-10-11 14:04:53,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:53,950 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 344 transitions. [2024-10-11 14:04:53,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 14:04:53,950 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 344 transitions. [2024-10-11 14:04:53,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 14:04:53,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:53,952 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:53,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:04:53,952 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:53,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:53,953 INFO L85 PathProgramCache]: Analyzing trace with hash 742262773, now seen corresponding path program 1 times [2024-10-11 14:04:53,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:53,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660601758] [2024-10-11 14:04:53,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:53,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:54,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:54,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:54,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:54,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:54,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:54,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:54,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:54,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:54,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:54,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:54,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:54,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:54,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:54,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:54,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:54,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:04:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:54,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:04:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:54,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:04:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:54,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:04:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:54,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 14:04:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:54,116 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 14:04:54,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:54,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660601758] [2024-10-11 14:04:54,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660601758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:54,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:54,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:04:54,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335178632] [2024-10-11 14:04:54,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:54,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:04:54,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:54,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:04:54,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:04:54,119 INFO L87 Difference]: Start difference. First operand 240 states and 344 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 14:04:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:54,185 INFO L93 Difference]: Finished difference Result 382 states and 548 transitions. [2024-10-11 14:04:54,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:04:54,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-10-11 14:04:54,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:54,190 INFO L225 Difference]: With dead ends: 382 [2024-10-11 14:04:54,190 INFO L226 Difference]: Without dead ends: 243 [2024-10-11 14:04:54,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:04:54,191 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:54,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 505 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:04:54,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-11 14:04:54,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2024-10-11 14:04:54,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 200 states have (on average 1.335) internal successors, (267), 200 states have internal predecessors, (267), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 14:04:54,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 347 transitions. [2024-10-11 14:04:54,234 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 347 transitions. Word has length 155 [2024-10-11 14:04:54,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:54,234 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 347 transitions. [2024-10-11 14:04:54,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 14:04:54,235 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 347 transitions. [2024-10-11 14:04:54,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 14:04:54,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:54,236 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:04:54,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:04:54,236 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:54,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:54,237 INFO L85 PathProgramCache]: Analyzing trace with hash 41198195, now seen corresponding path program 1 times [2024-10-11 14:04:54,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:04:54,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82867768] [2024-10-11 14:04:54,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:54,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:04:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:58,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:04:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:58,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:04:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:58,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:04:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:58,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:04:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:58,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:04:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:58,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:04:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:58,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:04:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:58,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:04:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:58,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:04:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:58,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:04:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:58,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:04:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:58,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:04:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:58,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:04:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:58,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:04:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:58,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:04:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:58,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:04:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:58,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:04:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:58,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:04:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:58,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:04:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:58,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 14:04:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:04:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 14:04:58,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:04:58,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82867768] [2024-10-11 14:04:58,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82867768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:04:58,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:04:58,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-11 14:04:58,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468417793] [2024-10-11 14:04:58,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:04:58,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 14:04:58,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:04:58,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 14:04:58,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2024-10-11 14:04:58,818 INFO L87 Difference]: Start difference. First operand 243 states and 347 transitions. Second operand has 18 states, 16 states have (on average 3.625) internal successors, (58), 18 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-11 14:05:00,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:05:00,809 INFO L93 Difference]: Finished difference Result 489 states and 689 transitions. [2024-10-11 14:05:00,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 14:05:00,809 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.625) internal successors, (58), 18 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 155 [2024-10-11 14:05:00,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:05:00,811 INFO L225 Difference]: With dead ends: 489 [2024-10-11 14:05:00,811 INFO L226 Difference]: Without dead ends: 347 [2024-10-11 14:05:00,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=196, Invalid=796, Unknown=0, NotChecked=0, Total=992 [2024-10-11 14:05:00,813 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 464 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:05:00,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 548 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 14:05:00,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-10-11 14:05:00,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 286. [2024-10-11 14:05:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 243 states have (on average 1.3497942386831276) internal successors, (328), 243 states have internal predecessors, (328), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 14:05:00,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 408 transitions. [2024-10-11 14:05:00,872 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 408 transitions. Word has length 155 [2024-10-11 14:05:00,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:05:00,873 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 408 transitions. [2024-10-11 14:05:00,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.625) internal successors, (58), 18 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-11 14:05:00,873 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 408 transitions. [2024-10-11 14:05:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 14:05:00,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:00,876 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:05:00,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 14:05:00,877 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:00,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:00,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1944940215, now seen corresponding path program 1 times [2024-10-11 14:05:00,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:00,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861187900] [2024-10-11 14:05:00,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:00,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:02,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:05:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:02,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:05:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:02,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:02,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:05:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:02,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:05:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:02,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:05:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:02,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:05:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:02,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:05:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:03,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:05:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:03,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:05:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:03,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:05:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:03,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:05:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:03,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:05:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:03,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:05:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:03,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:05:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:03,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:05:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:03,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:05:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:03,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:05:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:03,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:05:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:03,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 14:05:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:03,157 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 14:05:03,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:03,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861187900] [2024-10-11 14:05:03,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861187900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:05:03,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:05:03,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 14:05:03,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126568658] [2024-10-11 14:05:03,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:05:03,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 14:05:03,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:05:03,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 14:05:03,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:05:03,160 INFO L87 Difference]: Start difference. First operand 286 states and 408 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 14:05:04,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:05:04,526 INFO L93 Difference]: Finished difference Result 492 states and 698 transitions. [2024-10-11 14:05:04,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 14:05:04,527 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2024-10-11 14:05:04,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:05:04,529 INFO L225 Difference]: With dead ends: 492 [2024-10-11 14:05:04,529 INFO L226 Difference]: Without dead ends: 321 [2024-10-11 14:05:04,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2024-10-11 14:05:04,531 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 187 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 14:05:04,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 421 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 14:05:04,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-11 14:05:04,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 288. [2024-10-11 14:05:04,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 245 states have (on average 1.3428571428571427) internal successors, (329), 245 states have internal predecessors, (329), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 14:05:04,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 409 transitions. [2024-10-11 14:05:04,606 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 409 transitions. Word has length 155 [2024-10-11 14:05:04,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:05:04,606 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 409 transitions. [2024-10-11 14:05:04,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 14:05:04,606 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 409 transitions. [2024-10-11 14:05:04,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 14:05:04,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:04,608 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:05:04,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 14:05:04,608 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:04,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:04,609 INFO L85 PathProgramCache]: Analyzing trace with hash -92815311, now seen corresponding path program 1 times [2024-10-11 14:05:04,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:04,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861090264] [2024-10-11 14:05:04,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:04,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:05,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:05:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:05,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:05:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:05,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:05,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:05:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:05,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:05:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:05,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:05:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:05,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:05:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:05,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:05:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:05,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:05:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:05,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:05:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:05,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:05:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:05,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:05:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:05,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:05:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:05,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:05:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:05,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:05:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:05,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:05:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:05,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:05:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:05,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:05:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:05,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:05:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:05,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 14:05:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:05,750 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 14:05:05,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:05,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861090264] [2024-10-11 14:05:05,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861090264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:05:05,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:05:05,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:05:05,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692609190] [2024-10-11 14:05:05,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:05:05,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:05:05,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:05:05,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:05:05,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:05:05,753 INFO L87 Difference]: Start difference. First operand 288 states and 409 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 14:05:06,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:05:06,354 INFO L93 Difference]: Finished difference Result 547 states and 774 transitions. [2024-10-11 14:05:06,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:05:06,354 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2024-10-11 14:05:06,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:05:06,357 INFO L225 Difference]: With dead ends: 547 [2024-10-11 14:05:06,357 INFO L226 Difference]: Without dead ends: 374 [2024-10-11 14:05:06,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:05:06,359 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 146 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 14:05:06,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 421 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 14:05:06,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-11 14:05:06,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2024-10-11 14:05:06,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 319 states have (on average 1.347962382445141) internal successors, (430), 320 states have internal predecessors, (430), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 14:05:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 526 transitions. [2024-10-11 14:05:06,432 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 526 transitions. Word has length 155 [2024-10-11 14:05:06,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:05:06,432 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 526 transitions. [2024-10-11 14:05:06,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 14:05:06,433 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 526 transitions. [2024-10-11 14:05:06,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 14:05:06,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:06,434 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:05:06,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 14:05:06,434 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:06,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:06,435 INFO L85 PathProgramCache]: Analyzing trace with hash -332526037, now seen corresponding path program 1 times [2024-10-11 14:05:06,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:06,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967565058] [2024-10-11 14:05:06,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:06,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:07,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:05:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:07,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:05:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:07,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:07,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:05:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:07,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:05:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:07,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:05:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:07,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:05:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:07,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:05:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:07,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:05:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:07,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:05:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:07,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:05:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:07,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:05:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:07,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:05:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:07,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:05:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:07,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:05:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:07,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:05:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:07,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:05:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:07,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:05:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:07,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:05:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:07,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 14:05:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:07,999 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 14:05:07,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:07,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967565058] [2024-10-11 14:05:08,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967565058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:05:08,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:05:08,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 14:05:08,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895178048] [2024-10-11 14:05:08,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:05:08,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:05:08,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:05:08,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:05:08,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:05:08,001 INFO L87 Difference]: Start difference. First operand 371 states and 526 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 14:05:08,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:05:08,813 INFO L93 Difference]: Finished difference Result 712 states and 1005 transitions. [2024-10-11 14:05:08,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:05:08,814 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2024-10-11 14:05:08,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:05:08,818 INFO L225 Difference]: With dead ends: 712 [2024-10-11 14:05:08,818 INFO L226 Difference]: Without dead ends: 470 [2024-10-11 14:05:08,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-10-11 14:05:08,819 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 245 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 14:05:08,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 363 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 14:05:08,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-10-11 14:05:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 409. [2024-10-11 14:05:08,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 357 states have (on average 1.3557422969187676) internal successors, (484), 358 states have internal predecessors, (484), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 14:05:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 580 transitions. [2024-10-11 14:05:08,889 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 580 transitions. Word has length 155 [2024-10-11 14:05:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:05:08,889 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 580 transitions. [2024-10-11 14:05:08,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 14:05:08,890 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 580 transitions. [2024-10-11 14:05:08,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 14:05:08,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:08,891 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:05:08,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 14:05:08,892 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:08,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:08,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1612389715, now seen corresponding path program 1 times [2024-10-11 14:05:08,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:08,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090187771] [2024-10-11 14:05:08,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:08,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:09,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:05:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:09,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:05:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:09,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:09,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:05:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:09,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:05:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:09,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:05:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:09,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:05:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:09,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:05:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:09,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:05:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:09,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:05:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:09,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:05:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:09,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:05:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:09,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:05:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:09,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:05:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:09,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:05:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:09,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:05:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:09,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:05:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:09,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:05:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:09,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:05:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:09,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 14:05:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:09,126 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 14:05:09,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:09,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090187771] [2024-10-11 14:05:09,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090187771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:05:09,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:05:09,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:05:09,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263006343] [2024-10-11 14:05:09,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:05:09,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:05:09,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:05:09,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:05:09,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:05:09,128 INFO L87 Difference]: Start difference. First operand 409 states and 580 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 14:05:09,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:05:09,298 INFO L93 Difference]: Finished difference Result 653 states and 924 transitions. [2024-10-11 14:05:09,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:05:09,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-10-11 14:05:09,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:05:09,300 INFO L225 Difference]: With dead ends: 653 [2024-10-11 14:05:09,301 INFO L226 Difference]: Without dead ends: 371 [2024-10-11 14:05:09,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:05:09,302 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:05:09,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 409 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 14:05:09,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-10-11 14:05:09,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2024-10-11 14:05:09,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 319 states have (on average 1.341692789968652) internal successors, (428), 320 states have internal predecessors, (428), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 14:05:09,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 524 transitions. [2024-10-11 14:05:09,353 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 524 transitions. Word has length 155 [2024-10-11 14:05:09,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:05:09,354 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 524 transitions. [2024-10-11 14:05:09,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 14:05:09,354 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 524 transitions. [2024-10-11 14:05:09,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 14:05:09,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:09,355 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:05:09,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 14:05:09,356 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:09,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:09,356 INFO L85 PathProgramCache]: Analyzing trace with hash -270486423, now seen corresponding path program 1 times [2024-10-11 14:05:09,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:09,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260995254] [2024-10-11 14:05:09,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:09,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:10,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:05:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:10,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:05:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:10,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:10,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:05:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:10,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:05:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:10,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:05:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:10,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:05:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:10,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:05:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:10,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:05:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:10,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:05:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:10,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:05:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:10,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:05:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:10,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:05:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:10,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:05:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:10,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:05:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:10,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:05:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:10,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:05:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:10,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:05:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:10,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:05:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:10,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 14:05:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 14:05:10,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:10,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260995254] [2024-10-11 14:05:10,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260995254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:05:10,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:05:10,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 14:05:10,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963950964] [2024-10-11 14:05:10,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:05:10,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:05:10,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:05:10,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:05:10,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:05:10,885 INFO L87 Difference]: Start difference. First operand 371 states and 524 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 14:05:11,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:05:11,717 INFO L93 Difference]: Finished difference Result 694 states and 977 transitions. [2024-10-11 14:05:11,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:05:11,718 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2024-10-11 14:05:11,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:05:11,721 INFO L225 Difference]: With dead ends: 694 [2024-10-11 14:05:11,721 INFO L226 Difference]: Without dead ends: 452 [2024-10-11 14:05:11,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2024-10-11 14:05:11,724 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 203 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 14:05:11,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 375 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 14:05:11,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-10-11 14:05:11,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 391. [2024-10-11 14:05:11,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 339 states have (on average 1.3480825958702065) internal successors, (457), 340 states have internal predecessors, (457), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 14:05:11,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 553 transitions. [2024-10-11 14:05:11,797 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 553 transitions. Word has length 155 [2024-10-11 14:05:11,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:05:11,797 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 553 transitions. [2024-10-11 14:05:11,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 14:05:11,797 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 553 transitions. [2024-10-11 14:05:11,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 14:05:11,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:11,798 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:05:11,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 14:05:11,798 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:11,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:11,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1550350101, now seen corresponding path program 1 times [2024-10-11 14:05:11,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:11,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061317630] [2024-10-11 14:05:11,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:11,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:13,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:05:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:13,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:05:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:13,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:13,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:05:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:13,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:05:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:13,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:05:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:13,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:05:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:13,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:05:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:13,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:05:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:13,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:05:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:13,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:05:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:13,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:05:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:13,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:05:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:13,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:05:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:13,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:05:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:13,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:05:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:13,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:05:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:13,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:05:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:13,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:05:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:13,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 14:05:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 14:05:13,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:13,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061317630] [2024-10-11 14:05:13,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061317630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:05:13,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:05:13,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 14:05:13,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836663347] [2024-10-11 14:05:13,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:05:13,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 14:05:13,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:05:13,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 14:05:13,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:05:13,156 INFO L87 Difference]: Start difference. First operand 391 states and 553 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 14:05:14,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:05:14,235 INFO L93 Difference]: Finished difference Result 712 states and 1002 transitions. [2024-10-11 14:05:14,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:05:14,236 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2024-10-11 14:05:14,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:05:14,237 INFO L225 Difference]: With dead ends: 712 [2024-10-11 14:05:14,238 INFO L226 Difference]: Without dead ends: 452 [2024-10-11 14:05:14,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2024-10-11 14:05:14,239 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 254 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 14:05:14,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 557 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 14:05:14,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-10-11 14:05:14,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 393. [2024-10-11 14:05:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 341 states have (on average 1.346041055718475) internal successors, (459), 342 states have internal predecessors, (459), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 14:05:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 555 transitions. [2024-10-11 14:05:14,305 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 555 transitions. Word has length 155 [2024-10-11 14:05:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:05:14,306 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 555 transitions. [2024-10-11 14:05:14,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 14:05:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 555 transitions. [2024-10-11 14:05:14,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 14:05:14,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:14,307 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:05:14,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 14:05:14,307 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:14,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:14,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1427401589, now seen corresponding path program 1 times [2024-10-11 14:05:14,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:14,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971657974] [2024-10-11 14:05:14,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:14,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:15,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:05:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:15,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:05:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:15,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:15,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:05:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:15,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:05:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:15,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:05:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:15,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:05:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:15,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:05:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:15,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:05:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:15,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:05:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:15,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:05:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:15,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:05:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:15,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:05:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:15,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:05:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:15,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:05:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:15,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:05:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:15,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:05:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:15,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:05:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:15,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:05:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:15,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 14:05:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 14:05:15,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:15,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971657974] [2024-10-11 14:05:15,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971657974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:05:15,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:05:15,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 14:05:15,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052814337] [2024-10-11 14:05:15,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:05:15,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 14:05:15,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:05:15,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 14:05:15,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:05:15,541 INFO L87 Difference]: Start difference. First operand 393 states and 555 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 14:05:16,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:05:16,185 INFO L93 Difference]: Finished difference Result 727 states and 1018 transitions. [2024-10-11 14:05:16,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:05:16,186 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2024-10-11 14:05:16,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:05:16,188 INFO L225 Difference]: With dead ends: 727 [2024-10-11 14:05:16,188 INFO L226 Difference]: Without dead ends: 465 [2024-10-11 14:05:16,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:05:16,190 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 165 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:05:16,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 359 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 14:05:16,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-10-11 14:05:16,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 398. [2024-10-11 14:05:16,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 346 states have (on average 1.3410404624277457) internal successors, (464), 347 states have internal predecessors, (464), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 14:05:16,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 560 transitions. [2024-10-11 14:05:16,240 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 560 transitions. Word has length 155 [2024-10-11 14:05:16,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:05:16,241 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 560 transitions. [2024-10-11 14:05:16,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 14:05:16,241 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 560 transitions. [2024-10-11 14:05:16,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 14:05:16,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:16,242 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:05:16,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 14:05:16,242 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:16,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:16,242 INFO L85 PathProgramCache]: Analyzing trace with hash -160946313, now seen corresponding path program 1 times [2024-10-11 14:05:16,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:16,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242745186] [2024-10-11 14:05:16,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:16,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:17,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:05:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:17,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:05:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:17,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:17,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:05:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:17,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:05:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:17,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:05:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:17,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:05:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:17,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:05:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:17,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:05:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:17,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:05:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:17,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:05:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:17,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:05:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:17,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:05:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:17,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:05:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:17,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:05:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:17,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:05:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:17,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:05:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:17,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:05:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:17,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:05:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:17,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 14:05:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:17,837 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 14:05:17,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:17,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242745186] [2024-10-11 14:05:17,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242745186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:05:17,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:05:17,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:05:17,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444724657] [2024-10-11 14:05:17,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:05:17,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:05:17,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:05:17,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:05:17,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:05:17,839 INFO L87 Difference]: Start difference. First operand 398 states and 560 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 14:05:18,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:05:18,843 INFO L93 Difference]: Finished difference Result 705 states and 989 transitions. [2024-10-11 14:05:18,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 14:05:18,843 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2024-10-11 14:05:18,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:05:18,846 INFO L225 Difference]: With dead ends: 705 [2024-10-11 14:05:18,846 INFO L226 Difference]: Without dead ends: 440 [2024-10-11 14:05:18,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-10-11 14:05:18,847 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 196 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 14:05:18,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 423 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 14:05:18,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-11 14:05:18,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 403. [2024-10-11 14:05:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 351 states have (on average 1.3475783475783476) internal successors, (473), 352 states have internal predecessors, (473), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 14:05:18,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 569 transitions. [2024-10-11 14:05:18,917 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 569 transitions. Word has length 155 [2024-10-11 14:05:18,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:05:18,918 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 569 transitions. [2024-10-11 14:05:18,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 14:05:18,918 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 569 transitions. [2024-10-11 14:05:18,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 14:05:18,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:18,919 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:05:18,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 14:05:18,920 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:18,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:18,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2147084723, now seen corresponding path program 1 times [2024-10-11 14:05:18,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:18,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876943358] [2024-10-11 14:05:18,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:18,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:05:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:05:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:05:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:05:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:05:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:05:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:05:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:05:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:05:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:05:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:05:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:05:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:05:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:05:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:05:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:05:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:05:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:05:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 14:05:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:19,207 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 14:05:19,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:19,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876943358] [2024-10-11 14:05:19,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876943358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:05:19,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:05:19,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:05:19,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912642622] [2024-10-11 14:05:19,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:05:19,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:05:19,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:05:19,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:05:19,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:05:19,211 INFO L87 Difference]: Start difference. First operand 403 states and 569 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 14:05:19,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:05:19,405 INFO L93 Difference]: Finished difference Result 688 states and 973 transitions. [2024-10-11 14:05:19,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:05:19,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-10-11 14:05:19,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:05:19,408 INFO L225 Difference]: With dead ends: 688 [2024-10-11 14:05:19,408 INFO L226 Difference]: Without dead ends: 418 [2024-10-11 14:05:19,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:05:19,410 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:05:19,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 408 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 14:05:19,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-10-11 14:05:19,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2024-10-11 14:05:19,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 366 states have (on average 1.3442622950819672) internal successors, (492), 367 states have internal predecessors, (492), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 14:05:19,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 588 transitions. [2024-10-11 14:05:19,487 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 588 transitions. Word has length 155 [2024-10-11 14:05:19,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:05:19,487 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 588 transitions. [2024-10-11 14:05:19,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 14:05:19,487 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 588 transitions. [2024-10-11 14:05:19,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 14:05:19,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:19,489 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:05:19,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 14:05:19,489 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:19,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:19,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1136765323, now seen corresponding path program 1 times [2024-10-11 14:05:19,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:19,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346087079] [2024-10-11 14:05:19,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:19,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:05:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:05:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:05:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:05:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:05:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:05:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:05:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:05:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:05:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:05:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:05:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:05:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:05:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:05:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:05:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:05:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:05:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:05:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 14:05:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:20,995 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 14:05:20,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:20,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346087079] [2024-10-11 14:05:20,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346087079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:05:20,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:05:20,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 14:05:20,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245350197] [2024-10-11 14:05:20,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:05:20,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 14:05:20,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:05:20,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 14:05:20,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:05:20,996 INFO L87 Difference]: Start difference. First operand 418 states and 588 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 14:05:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:05:21,878 INFO L93 Difference]: Finished difference Result 759 states and 1061 transitions. [2024-10-11 14:05:21,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:05:21,879 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2024-10-11 14:05:21,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:05:21,881 INFO L225 Difference]: With dead ends: 759 [2024-10-11 14:05:21,881 INFO L226 Difference]: Without dead ends: 474 [2024-10-11 14:05:21,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-10-11 14:05:21,883 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 246 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 14:05:21,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 521 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 14:05:21,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-10-11 14:05:21,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 414. [2024-10-11 14:05:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 362 states have (on average 1.3425414364640884) internal successors, (486), 363 states have internal predecessors, (486), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 14:05:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 582 transitions. [2024-10-11 14:05:21,954 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 582 transitions. Word has length 155 [2024-10-11 14:05:21,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:05:21,955 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 582 transitions. [2024-10-11 14:05:21,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 14:05:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 582 transitions. [2024-10-11 14:05:21,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 14:05:21,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:05:21,956 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:05:21,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 14:05:21,956 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:05:21,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:05:21,957 INFO L85 PathProgramCache]: Analyzing trace with hash 132028438, now seen corresponding path program 1 times [2024-10-11 14:05:21,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:05:21,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489395988] [2024-10-11 14:05:21,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:05:21,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:05:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:23,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:05:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:23,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:05:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:23,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:05:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:23,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:05:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:23,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:05:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:23,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:05:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:23,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:05:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:23,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:05:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:23,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:05:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:23,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:05:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:23,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:05:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:23,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:05:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:23,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:05:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:23,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:05:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:23,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:05:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:23,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:05:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:23,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:05:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:23,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:05:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:23,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:05:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:23,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 14:05:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:05:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 14:05:24,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:05:24,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489395988] [2024-10-11 14:05:24,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489395988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:05:24,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:05:24,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 14:05:24,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716678031] [2024-10-11 14:05:24,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:05:24,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 14:05:24,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:05:24,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 14:05:24,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:05:24,009 INFO L87 Difference]: Start difference. First operand 414 states and 582 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20)