./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-a_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-27.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4734516ebdc79a9f036bc9e9f726759934a87ca68d15ce0ae4878f15df0c2c4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:55:57,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:55:57,412 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:55:57,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:55:57,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:55:57,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:55:57,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:55:57,441 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:55:57,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:55:57,442 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:55:57,442 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:55:57,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:55:57,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:55:57,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:55:57,443 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:55:57,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:55:57,444 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:55:57,444 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:55:57,444 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:55:57,445 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:55:57,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:55:57,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:55:57,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:55:57,451 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:55:57,452 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:55:57,452 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:55:57,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:55:57,453 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:55:57,453 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:55:57,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:55:57,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:55:57,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:55:57,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:55:57,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:55:57,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:55:57,455 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:55:57,455 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:55:57,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:55:57,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:55:57,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:55:57,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:55:57,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:55:57,458 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4734516ebdc79a9f036bc9e9f726759934a87ca68d15ce0ae4878f15df0c2c4 [2024-10-13 05:55:57,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:55:57,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:55:57,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:55:57,676 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:55:57,677 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:55:57,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-27.i [2024-10-13 05:55:58,997 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:55:59,172 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:55:59,172 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-27.i [2024-10-13 05:55:59,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efa591ec8/4594fd4487934ce9ace69269f51fb1f2/FLAG80353daa3 [2024-10-13 05:55:59,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efa591ec8/4594fd4487934ce9ace69269f51fb1f2 [2024-10-13 05:55:59,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:55:59,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:55:59,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:55:59,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:55:59,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:55:59,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:55:59" (1/1) ... [2024-10-13 05:55:59,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d054f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:59, skipping insertion in model container [2024-10-13 05:55:59,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:55:59" (1/1) ... [2024-10-13 05:55:59,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:55:59,371 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-a_file-27.i[916,929] [2024-10-13 05:55:59,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:55:59,428 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:55:59,442 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-a_file-27.i[916,929] [2024-10-13 05:55:59,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:55:59,503 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:55:59,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:59 WrapperNode [2024-10-13 05:55:59,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:55:59,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:55:59,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:55:59,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:55:59,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:59" (1/1) ... [2024-10-13 05:55:59,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:59" (1/1) ... [2024-10-13 05:55:59,558 INFO L138 Inliner]: procedures = 26, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 433 [2024-10-13 05:55:59,559 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:55:59,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:55:59,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:55:59,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:55:59,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:59" (1/1) ... [2024-10-13 05:55:59,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:59" (1/1) ... [2024-10-13 05:55:59,588 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:59" (1/1) ... [2024-10-13 05:55:59,609 INFO L175 MemorySlicer]: Split 123 memory accesses to 5 slices as follows [2, 16, 70, 11, 24]. 57 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 6, 1, 3]. The 16 writes are split as follows [0, 2, 8, 1, 5]. [2024-10-13 05:55:59,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:59" (1/1) ... [2024-10-13 05:55:59,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:59" (1/1) ... [2024-10-13 05:55:59,623 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:59" (1/1) ... [2024-10-13 05:55:59,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:59" (1/1) ... [2024-10-13 05:55:59,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:59" (1/1) ... [2024-10-13 05:55:59,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:59" (1/1) ... [2024-10-13 05:55:59,632 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:55:59,632 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:55:59,632 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:55:59,633 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:55:59,633 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:59" (1/1) ... [2024-10-13 05:55:59,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:55:59,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:55:59,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 05:55:59,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 05:55:59,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:55:59,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 05:55:59,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 05:55:59,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 05:55:59,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 05:55:59,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 05:55:59,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 05:55:59,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 05:55:59,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 05:55:59,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 05:55:59,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 05:55:59,724 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:55:59,724 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:55:59,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:55:59,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 05:55:59,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 05:55:59,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 05:55:59,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 05:55:59,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:55:59,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:55:59,811 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:55:59,813 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:56:00,139 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-10-13 05:56:00,139 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:56:00,173 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:56:00,175 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:56:00,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:56:00 BoogieIcfgContainer [2024-10-13 05:56:00,175 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:56:00,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:56:00,178 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:56:00,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:56:00,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:55:59" (1/3) ... [2024-10-13 05:56:00,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c18eaf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:56:00, skipping insertion in model container [2024-10-13 05:56:00,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:55:59" (2/3) ... [2024-10-13 05:56:00,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c18eaf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:56:00, skipping insertion in model container [2024-10-13 05:56:00,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:56:00" (3/3) ... [2024-10-13 05:56:00,187 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-27.i [2024-10-13 05:56:00,203 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:56:00,204 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:56:00,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:56:00,256 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;@2133141b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:56:00,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:56:00,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 05:56:00,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 05:56:00,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:00,269 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:00,269 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:00,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:00,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1965699129, now seen corresponding path program 1 times [2024-10-13 05:56:00,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:00,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108890885] [2024-10-13 05:56:00,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:00,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:00,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:00,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:00,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:00,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:00,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:00,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:00,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:00,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:00,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:00,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:00,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:00,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:00,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:00,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:00,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:00,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:00,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:00,580 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:00,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:00,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108890885] [2024-10-13 05:56:00,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108890885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:00,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:00,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:56:00,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541116834] [2024-10-13 05:56:00,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:00,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:56:00,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:00,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:56:00,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:56:00,612 INFO L87 Difference]: Start difference. First operand has 87 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:00,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:00,643 INFO L93 Difference]: Finished difference Result 171 states and 273 transitions. [2024-10-13 05:56:00,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:56:00,648 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 126 [2024-10-13 05:56:00,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:00,654 INFO L225 Difference]: With dead ends: 171 [2024-10-13 05:56:00,654 INFO L226 Difference]: Without dead ends: 85 [2024-10-13 05:56:00,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:56:00,660 INFO L432 NwaCegarLoop]: 120 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, 120 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-13 05:56:00,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:56:00,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-13 05:56:00,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-13 05:56:00,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 05:56:00,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 124 transitions. [2024-10-13 05:56:00,735 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 124 transitions. Word has length 126 [2024-10-13 05:56:00,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:00,736 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 124 transitions. [2024-10-13 05:56:00,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:00,737 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 124 transitions. [2024-10-13 05:56:00,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 05:56:00,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:00,743 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:00,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:56:00,744 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:00,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:00,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2096195045, now seen corresponding path program 1 times [2024-10-13 05:56:00,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:00,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966556497] [2024-10-13 05:56:00,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:00,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:02,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:02,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:02,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:02,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:02,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:02,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:02,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:02,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:02,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:02,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:02,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:02,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:02,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:02,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:02,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:02,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:02,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:02,180 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:02,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:02,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966556497] [2024-10-13 05:56:02,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966556497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:02,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:02,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 05:56:02,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991675660] [2024-10-13 05:56:02,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:02,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:56:02,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:02,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:56:02,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:56:02,184 INFO L87 Difference]: Start difference. First operand 85 states and 124 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:02,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:02,476 INFO L93 Difference]: Finished difference Result 222 states and 322 transitions. [2024-10-13 05:56:02,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 05:56:02,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 126 [2024-10-13 05:56:02,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:02,479 INFO L225 Difference]: With dead ends: 222 [2024-10-13 05:56:02,479 INFO L226 Difference]: Without dead ends: 138 [2024-10-13 05:56:02,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:56:02,482 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 67 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:02,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 557 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:56:02,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-13 05:56:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2024-10-13 05:56:02,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 109 states have (on average 1.3761467889908257) internal successors, (150), 110 states have internal predecessors, (150), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 05:56:02,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 196 transitions. [2024-10-13 05:56:02,509 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 196 transitions. Word has length 126 [2024-10-13 05:56:02,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:02,510 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 196 transitions. [2024-10-13 05:56:02,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:02,510 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 196 transitions. [2024-10-13 05:56:02,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 05:56:02,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:02,514 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:02,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:56:02,515 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:02,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:02,515 INFO L85 PathProgramCache]: Analyzing trace with hash 767202026, now seen corresponding path program 1 times [2024-10-13 05:56:02,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:02,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130221618] [2024-10-13 05:56:02,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:02,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,087 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:03,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:03,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130221618] [2024-10-13 05:56:03,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130221618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:03,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:03,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:56:03,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48715707] [2024-10-13 05:56:03,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:03,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:56:03,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:03,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:56:03,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:56:03,091 INFO L87 Difference]: Start difference. First operand 135 states and 196 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:56:03,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:03,379 INFO L93 Difference]: Finished difference Result 347 states and 505 transitions. [2024-10-13 05:56:03,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 05:56:03,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 128 [2024-10-13 05:56:03,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:03,383 INFO L225 Difference]: With dead ends: 347 [2024-10-13 05:56:03,383 INFO L226 Difference]: Without dead ends: 213 [2024-10-13 05:56:03,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:56:03,385 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 107 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:03,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 684 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:56:03,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-13 05:56:03,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209. [2024-10-13 05:56:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 165 states have (on average 1.3575757575757577) internal successors, (224), 166 states have internal predecessors, (224), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 05:56:03,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 304 transitions. [2024-10-13 05:56:03,400 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 304 transitions. Word has length 128 [2024-10-13 05:56:03,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:03,401 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 304 transitions. [2024-10-13 05:56:03,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:56:03,401 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 304 transitions. [2024-10-13 05:56:03,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 05:56:03,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:03,403 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:03,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 05:56:03,403 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:03,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:03,403 INFO L85 PathProgramCache]: Analyzing trace with hash 191236330, now seen corresponding path program 1 times [2024-10-13 05:56:03,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:03,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612650630] [2024-10-13 05:56:03,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:03,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:03,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:03,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612650630] [2024-10-13 05:56:03,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612650630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:03,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:03,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:56:03,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342189107] [2024-10-13 05:56:03,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:03,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:56:03,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:03,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:56:03,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:56:03,884 INFO L87 Difference]: Start difference. First operand 209 states and 304 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:56:04,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:04,126 INFO L93 Difference]: Finished difference Result 395 states and 571 transitions. [2024-10-13 05:56:04,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 05:56:04,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 128 [2024-10-13 05:56:04,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:04,128 INFO L225 Difference]: With dead ends: 395 [2024-10-13 05:56:04,128 INFO L226 Difference]: Without dead ends: 171 [2024-10-13 05:56:04,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:56:04,130 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 108 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:04,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 495 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:56:04,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-13 05:56:04,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2024-10-13 05:56:04,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 129 states have (on average 1.317829457364341) internal successors, (170), 129 states have internal predecessors, (170), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 05:56:04,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 238 transitions. [2024-10-13 05:56:04,142 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 238 transitions. Word has length 128 [2024-10-13 05:56:04,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:04,142 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 238 transitions. [2024-10-13 05:56:04,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:56:04,143 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 238 transitions. [2024-10-13 05:56:04,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 05:56:04,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:04,144 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:04,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 05:56:04,144 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:04,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:04,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2018852367, now seen corresponding path program 1 times [2024-10-13 05:56:04,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:04,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998266792] [2024-10-13 05:56:04,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:04,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:04,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:04,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998266792] [2024-10-13 05:56:04,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998266792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:04,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:04,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:56:04,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297042762] [2024-10-13 05:56:04,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:04,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:56:04,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:04,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:56:04,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:56:04,439 INFO L87 Difference]: Start difference. First operand 167 states and 238 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:04,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:04,526 INFO L93 Difference]: Finished difference Result 433 states and 615 transitions. [2024-10-13 05:56:04,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:56:04,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 129 [2024-10-13 05:56:04,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:04,529 INFO L225 Difference]: With dead ends: 433 [2024-10-13 05:56:04,529 INFO L226 Difference]: Without dead ends: 267 [2024-10-13 05:56:04,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:56:04,530 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 137 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:04,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 538 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:56:04,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-13 05:56:04,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 263. [2024-10-13 05:56:04,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 219 states have (on average 1.356164383561644) internal successors, (297), 221 states have internal predecessors, (297), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 05:56:04,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 373 transitions. [2024-10-13 05:56:04,547 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 373 transitions. Word has length 129 [2024-10-13 05:56:04,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:04,552 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 373 transitions. [2024-10-13 05:56:04,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:04,552 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 373 transitions. [2024-10-13 05:56:04,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 05:56:04,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:04,553 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:04,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 05:56:04,554 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:04,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:04,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1878303757, now seen corresponding path program 1 times [2024-10-13 05:56:04,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:04,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829450445] [2024-10-13 05:56:04,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:04,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:04,894 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:04,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:04,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829450445] [2024-10-13 05:56:04,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829450445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:04,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:04,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:56:04,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919099358] [2024-10-13 05:56:04,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:04,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:56:04,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:04,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:56:04,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:56:04,898 INFO L87 Difference]: Start difference. First operand 263 states and 373 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:04,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:04,984 INFO L93 Difference]: Finished difference Result 631 states and 885 transitions. [2024-10-13 05:56:04,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:56:04,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 129 [2024-10-13 05:56:04,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:04,986 INFO L225 Difference]: With dead ends: 631 [2024-10-13 05:56:04,986 INFO L226 Difference]: Without dead ends: 369 [2024-10-13 05:56:04,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:56:04,988 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 64 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:04,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 599 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:56:04,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-13 05:56:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 207. [2024-10-13 05:56:05,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 167 states have (on average 1.311377245508982) internal successors, (219), 167 states have internal predecessors, (219), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 05:56:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 287 transitions. [2024-10-13 05:56:05,007 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 287 transitions. Word has length 129 [2024-10-13 05:56:05,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:05,008 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 287 transitions. [2024-10-13 05:56:05,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 287 transitions. [2024-10-13 05:56:05,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 05:56:05,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:05,009 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:05,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 05:56:05,010 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:05,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:05,011 INFO L85 PathProgramCache]: Analyzing trace with hash -23200275, now seen corresponding path program 1 times [2024-10-13 05:56:05,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:05,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920827841] [2024-10-13 05:56:05,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:05,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:05,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:05,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:05,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:05,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:05,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:05,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:05,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:05,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:05,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:05,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:05,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:05,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:05,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:05,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:05,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:05,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:05,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:05,825 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:05,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:05,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920827841] [2024-10-13 05:56:05,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920827841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:05,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:05,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 05:56:05,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104667069] [2024-10-13 05:56:05,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:05,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 05:56:05,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:05,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 05:56:05,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:56:05,828 INFO L87 Difference]: Start difference. First operand 207 states and 287 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:06,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:06,260 INFO L93 Difference]: Finished difference Result 477 states and 658 transitions. [2024-10-13 05:56:06,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 05:56:06,261 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2024-10-13 05:56:06,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:06,262 INFO L225 Difference]: With dead ends: 477 [2024-10-13 05:56:06,262 INFO L226 Difference]: Without dead ends: 271 [2024-10-13 05:56:06,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:56:06,264 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 69 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:06,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1077 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:56:06,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-13 05:56:06,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2024-10-13 05:56:06,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 220 states have (on average 1.3136363636363637) internal successors, (289), 221 states have internal predecessors, (289), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 05:56:06,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 369 transitions. [2024-10-13 05:56:06,282 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 369 transitions. Word has length 130 [2024-10-13 05:56:06,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:06,282 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 369 transitions. [2024-10-13 05:56:06,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:06,282 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 369 transitions. [2024-10-13 05:56:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 05:56:06,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:06,283 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:06,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 05:56:06,284 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:06,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:06,284 INFO L85 PathProgramCache]: Analyzing trace with hash 677864303, now seen corresponding path program 1 times [2024-10-13 05:56:06,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:06,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349069987] [2024-10-13 05:56:06,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:06,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:06,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:06,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:06,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:06,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:06,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:06,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:06,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:06,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:06,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:06,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:06,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:06,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:06,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:06,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:06,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:06,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:06,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:06,909 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:06,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:06,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349069987] [2024-10-13 05:56:06,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349069987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:06,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:06,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:56:06,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601670710] [2024-10-13 05:56:06,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:06,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:56:06,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:06,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:56:06,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:56:06,911 INFO L87 Difference]: Start difference. First operand 268 states and 369 transitions. Second operand has 9 states, 7 states have (on average 6.857142857142857) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-13 05:56:07,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:07,151 INFO L93 Difference]: Finished difference Result 538 states and 737 transitions. [2024-10-13 05:56:07,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:56:07,151 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.857142857142857) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 130 [2024-10-13 05:56:07,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:07,152 INFO L225 Difference]: With dead ends: 538 [2024-10-13 05:56:07,153 INFO L226 Difference]: Without dead ends: 271 [2024-10-13 05:56:07,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:56:07,154 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 57 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:07,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 890 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:56:07,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-13 05:56:07,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2024-10-13 05:56:07,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 220 states have (on average 1.3045454545454545) internal successors, (287), 221 states have internal predecessors, (287), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 05:56:07,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 367 transitions. [2024-10-13 05:56:07,174 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 367 transitions. Word has length 130 [2024-10-13 05:56:07,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:07,175 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 367 transitions. [2024-10-13 05:56:07,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.857142857142857) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-13 05:56:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 367 transitions. [2024-10-13 05:56:07,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 05:56:07,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:07,176 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:07,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 05:56:07,176 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:07,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:07,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1712144017, now seen corresponding path program 1 times [2024-10-13 05:56:07,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:07,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447839529] [2024-10-13 05:56:07,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:07,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:07,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:07,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:07,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:07,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:07,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:07,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:07,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:07,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:07,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:07,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:07,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:07,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:07,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:07,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:07,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:07,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:07,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:07,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:07,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447839529] [2024-10-13 05:56:07,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447839529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:07,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:07,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 05:56:07,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797671909] [2024-10-13 05:56:07,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:07,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 05:56:07,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:07,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 05:56:07,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:56:07,771 INFO L87 Difference]: Start difference. First operand 269 states and 367 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:07,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:07,995 INFO L93 Difference]: Finished difference Result 543 states and 737 transitions. [2024-10-13 05:56:07,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 05:56:07,996 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2024-10-13 05:56:07,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:07,999 INFO L225 Difference]: With dead ends: 543 [2024-10-13 05:56:07,999 INFO L226 Difference]: Without dead ends: 275 [2024-10-13 05:56:07,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:56:08,001 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 58 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:08,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 606 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:56:08,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-13 05:56:08,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2024-10-13 05:56:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 223 states have (on average 1.295964125560538) internal successors, (289), 224 states have internal predecessors, (289), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 05:56:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 369 transitions. [2024-10-13 05:56:08,017 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 369 transitions. Word has length 130 [2024-10-13 05:56:08,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:08,017 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 369 transitions. [2024-10-13 05:56:08,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 369 transitions. [2024-10-13 05:56:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 05:56:08,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:08,018 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:08,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 05:56:08,019 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:08,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:08,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1011079439, now seen corresponding path program 1 times [2024-10-13 05:56:08,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:08,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476004539] [2024-10-13 05:56:08,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:08,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:08,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:08,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:08,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:08,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:08,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:08,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:08,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:08,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:08,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:08,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:08,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:08,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:08,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:08,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:08,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:08,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:08,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:08,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:08,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476004539] [2024-10-13 05:56:08,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476004539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:08,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:08,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 05:56:08,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813664006] [2024-10-13 05:56:08,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:08,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 05:56:08,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:08,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 05:56:08,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:56:08,823 INFO L87 Difference]: Start difference. First operand 273 states and 369 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:09,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:09,437 INFO L93 Difference]: Finished difference Result 564 states and 757 transitions. [2024-10-13 05:56:09,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 05:56:09,437 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2024-10-13 05:56:09,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:09,439 INFO L225 Difference]: With dead ends: 564 [2024-10-13 05:56:09,439 INFO L226 Difference]: Without dead ends: 292 [2024-10-13 05:56:09,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-13 05:56:09,440 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 59 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:09,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1259 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 05:56:09,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-13 05:56:09,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 273. [2024-10-13 05:56:09,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 223 states have (on average 1.2914798206278026) internal successors, (288), 224 states have internal predecessors, (288), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 05:56:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 368 transitions. [2024-10-13 05:56:09,459 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 368 transitions. Word has length 130 [2024-10-13 05:56:09,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:09,462 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 368 transitions. [2024-10-13 05:56:09,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 368 transitions. [2024-10-13 05:56:09,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 05:56:09,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:09,463 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:09,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 05:56:09,463 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:09,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:09,464 INFO L85 PathProgramCache]: Analyzing trace with hash 327502817, now seen corresponding path program 1 times [2024-10-13 05:56:09,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:09,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821048299] [2024-10-13 05:56:09,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:09,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:09,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:09,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:09,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:09,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:09,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:09,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:09,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:09,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:09,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:09,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:09,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:09,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:09,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:09,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:09,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:09,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:09,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:09,795 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:09,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:09,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821048299] [2024-10-13 05:56:09,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821048299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:09,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:09,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:56:09,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457948188] [2024-10-13 05:56:09,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:09,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:56:09,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:09,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:56:09,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:56:09,796 INFO L87 Difference]: Start difference. First operand 273 states and 368 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:09,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:09,917 INFO L93 Difference]: Finished difference Result 679 states and 913 transitions. [2024-10-13 05:56:09,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:56:09,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2024-10-13 05:56:09,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:09,920 INFO L225 Difference]: With dead ends: 679 [2024-10-13 05:56:09,920 INFO L226 Difference]: Without dead ends: 407 [2024-10-13 05:56:09,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:56:09,921 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 111 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:09,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 440 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:56:09,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-10-13 05:56:09,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 318. [2024-10-13 05:56:09,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 268 states have (on average 1.2761194029850746) internal successors, (342), 269 states have internal predecessors, (342), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 05:56:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 422 transitions. [2024-10-13 05:56:09,940 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 422 transitions. Word has length 130 [2024-10-13 05:56:09,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:09,941 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 422 transitions. [2024-10-13 05:56:09,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:09,942 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 422 transitions. [2024-10-13 05:56:09,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 05:56:09,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:09,943 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:09,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 05:56:09,944 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:09,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:09,944 INFO L85 PathProgramCache]: Analyzing trace with hash -65524193, now seen corresponding path program 1 times [2024-10-13 05:56:09,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:09,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268641895] [2024-10-13 05:56:09,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:09,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:10,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:10,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:10,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:10,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:10,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:10,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:10,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:10,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:10,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:10,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:10,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:10,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:10,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:10,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:10,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:10,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:10,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:10,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:10,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268641895] [2024-10-13 05:56:10,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268641895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:10,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:10,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:56:10,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592488494] [2024-10-13 05:56:10,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:10,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:56:10,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:10,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:56:10,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:56:10,634 INFO L87 Difference]: Start difference. First operand 318 states and 422 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:11,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:11,202 INFO L93 Difference]: Finished difference Result 839 states and 1106 transitions. [2024-10-13 05:56:11,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 05:56:11,203 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2024-10-13 05:56:11,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:11,205 INFO L225 Difference]: With dead ends: 839 [2024-10-13 05:56:11,205 INFO L226 Difference]: Without dead ends: 522 [2024-10-13 05:56:11,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:56:11,206 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 68 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:11,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 804 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 05:56:11,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-10-13 05:56:11,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 518. [2024-10-13 05:56:11,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 437 states have (on average 1.263157894736842) internal successors, (552), 441 states have internal predecessors, (552), 62 states have call successors, (62), 18 states have call predecessors, (62), 18 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-13 05:56:11,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 676 transitions. [2024-10-13 05:56:11,235 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 676 transitions. Word has length 130 [2024-10-13 05:56:11,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:11,235 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 676 transitions. [2024-10-13 05:56:11,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:11,235 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 676 transitions. [2024-10-13 05:56:11,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 05:56:11,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:11,236 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:11,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 05:56:11,237 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:11,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:11,237 INFO L85 PathProgramCache]: Analyzing trace with hash 75024417, now seen corresponding path program 1 times [2024-10-13 05:56:11,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:11,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819586198] [2024-10-13 05:56:11,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:11,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:11,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:11,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819586198] [2024-10-13 05:56:11,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819586198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:11,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:11,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:56:11,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783068366] [2024-10-13 05:56:11,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:11,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:56:11,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:11,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:56:11,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:56:11,424 INFO L87 Difference]: Start difference. First operand 518 states and 676 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:56:11,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:11,498 INFO L93 Difference]: Finished difference Result 1029 states and 1341 transitions. [2024-10-13 05:56:11,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:56:11,499 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2024-10-13 05:56:11,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:11,501 INFO L225 Difference]: With dead ends: 1029 [2024-10-13 05:56:11,501 INFO L226 Difference]: Without dead ends: 512 [2024-10-13 05:56:11,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:56:11,503 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 90 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:11,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 432 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:56:11,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-10-13 05:56:11,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 509. [2024-10-13 05:56:11,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 428 states have (on average 1.2546728971962617) internal successors, (537), 432 states have internal predecessors, (537), 62 states have call successors, (62), 18 states have call predecessors, (62), 18 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-13 05:56:11,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 661 transitions. [2024-10-13 05:56:11,532 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 661 transitions. Word has length 130 [2024-10-13 05:56:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:11,532 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 661 transitions. [2024-10-13 05:56:11,532 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:56:11,533 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 661 transitions. [2024-10-13 05:56:11,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 05:56:11,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:11,534 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:11,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 05:56:11,535 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:11,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:11,535 INFO L85 PathProgramCache]: Analyzing trace with hash -458096856, now seen corresponding path program 1 times [2024-10-13 05:56:11,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:11,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727104451] [2024-10-13 05:56:11,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:11,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:11,925 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:11,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:11,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727104451] [2024-10-13 05:56:11,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727104451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:11,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:11,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:56:11,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570184384] [2024-10-13 05:56:11,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:11,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:56:11,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:11,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:56:11,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:56:11,927 INFO L87 Difference]: Start difference. First operand 509 states and 661 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:56:12,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:12,315 INFO L93 Difference]: Finished difference Result 1417 states and 1829 transitions. [2024-10-13 05:56:12,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:56:12,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-13 05:56:12,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:12,319 INFO L225 Difference]: With dead ends: 1417 [2024-10-13 05:56:12,319 INFO L226 Difference]: Without dead ends: 909 [2024-10-13 05:56:12,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:56:12,321 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 57 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:12,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 406 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:56:12,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2024-10-13 05:56:12,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 659. [2024-10-13 05:56:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 578 states have (on average 1.2629757785467128) internal successors, (730), 582 states have internal predecessors, (730), 62 states have call successors, (62), 18 states have call predecessors, (62), 18 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-13 05:56:12,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 854 transitions. [2024-10-13 05:56:12,356 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 854 transitions. Word has length 134 [2024-10-13 05:56:12,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:12,357 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 854 transitions. [2024-10-13 05:56:12,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:56:12,357 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 854 transitions. [2024-10-13 05:56:12,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 05:56:12,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:12,358 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:12,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 05:56:12,358 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:12,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:12,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1267443482, now seen corresponding path program 1 times [2024-10-13 05:56:12,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:12,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374937440] [2024-10-13 05:56:12,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:12,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,097 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:13,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:13,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374937440] [2024-10-13 05:56:13,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374937440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:13,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:13,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 05:56:13,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537791953] [2024-10-13 05:56:13,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:13,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 05:56:13,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:13,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 05:56:13,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:56:13,100 INFO L87 Difference]: Start difference. First operand 659 states and 854 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:56:13,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:13,539 INFO L93 Difference]: Finished difference Result 1479 states and 1910 transitions. [2024-10-13 05:56:13,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 05:56:13,540 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-13 05:56:13,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:13,542 INFO L225 Difference]: With dead ends: 1479 [2024-10-13 05:56:13,542 INFO L226 Difference]: Without dead ends: 821 [2024-10-13 05:56:13,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-10-13 05:56:13,546 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 61 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:13,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 999 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:56:13,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2024-10-13 05:56:13,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 675. [2024-10-13 05:56:13,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 594 states have (on average 1.2558922558922558) internal successors, (746), 598 states have internal predecessors, (746), 62 states have call successors, (62), 18 states have call predecessors, (62), 18 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-13 05:56:13,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 870 transitions. [2024-10-13 05:56:13,580 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 870 transitions. Word has length 134 [2024-10-13 05:56:13,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:13,581 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 870 transitions. [2024-10-13 05:56:13,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:56:13,581 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 870 transitions. [2024-10-13 05:56:13,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 05:56:13,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:13,584 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:13,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 05:56:13,584 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:13,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:13,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1642295471, now seen corresponding path program 1 times [2024-10-13 05:56:13,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:13,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525856766] [2024-10-13 05:56:13,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:13,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:13,826 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:13,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:13,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525856766] [2024-10-13 05:56:13,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525856766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:13,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:13,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:56:13,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062566518] [2024-10-13 05:56:13,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:13,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:56:13,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:13,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:56:13,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:56:13,829 INFO L87 Difference]: Start difference. First operand 675 states and 870 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:13,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:13,918 INFO L93 Difference]: Finished difference Result 1458 states and 1881 transitions. [2024-10-13 05:56:13,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:56:13,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2024-10-13 05:56:13,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:13,921 INFO L225 Difference]: With dead ends: 1458 [2024-10-13 05:56:13,921 INFO L226 Difference]: Without dead ends: 784 [2024-10-13 05:56:13,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:56:13,923 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 50 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:13,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 537 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:56:13,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-10-13 05:56:13,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 703. [2024-10-13 05:56:13,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 622 states have (on average 1.2556270096463023) internal successors, (781), 626 states have internal predecessors, (781), 62 states have call successors, (62), 18 states have call predecessors, (62), 18 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-13 05:56:13,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 905 transitions. [2024-10-13 05:56:13,953 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 905 transitions. Word has length 134 [2024-10-13 05:56:13,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:13,954 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 905 transitions. [2024-10-13 05:56:13,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:13,954 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 905 transitions. [2024-10-13 05:56:13,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 05:56:13,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:13,956 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:13,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 05:56:13,956 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:13,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:13,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1843325199, now seen corresponding path program 1 times [2024-10-13 05:56:13,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:13,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366403077] [2024-10-13 05:56:13,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:13,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:14,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:14,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366403077] [2024-10-13 05:56:14,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366403077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:14,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:14,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:56:14,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351654536] [2024-10-13 05:56:14,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:14,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:56:14,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:14,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:56:14,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:56:14,097 INFO L87 Difference]: Start difference. First operand 703 states and 905 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:56:14,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:14,145 INFO L93 Difference]: Finished difference Result 1426 states and 1836 transitions. [2024-10-13 05:56:14,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:56:14,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-13 05:56:14,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:14,148 INFO L225 Difference]: With dead ends: 1426 [2024-10-13 05:56:14,149 INFO L226 Difference]: Without dead ends: 724 [2024-10-13 05:56:14,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:56:14,150 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:14,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 569 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:56:14,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-10-13 05:56:14,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 712. [2024-10-13 05:56:14,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 631 states have (on average 1.2519809825673534) internal successors, (790), 635 states have internal predecessors, (790), 62 states have call successors, (62), 18 states have call predecessors, (62), 18 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-13 05:56:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 914 transitions. [2024-10-13 05:56:14,177 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 914 transitions. Word has length 134 [2024-10-13 05:56:14,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:14,177 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 914 transitions. [2024-10-13 05:56:14,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:56:14,177 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 914 transitions. [2024-10-13 05:56:14,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 05:56:14,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:14,179 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:14,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 05:56:14,179 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:14,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:14,179 INFO L85 PathProgramCache]: Analyzing trace with hash -520136470, now seen corresponding path program 1 times [2024-10-13 05:56:14,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:14,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045739804] [2024-10-13 05:56:14,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:14,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:14,821 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:14,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:14,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045739804] [2024-10-13 05:56:14,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045739804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:14,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:14,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 05:56:14,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847986700] [2024-10-13 05:56:14,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:14,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 05:56:14,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:14,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 05:56:14,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:56:14,824 INFO L87 Difference]: Start difference. First operand 712 states and 914 transitions. Second operand has 12 states, 10 states have (on average 5.2) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-13 05:56:15,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:15,529 INFO L93 Difference]: Finished difference Result 1992 states and 2536 transitions. [2024-10-13 05:56:15,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 05:56:15,530 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.2) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 134 [2024-10-13 05:56:15,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:15,534 INFO L225 Difference]: With dead ends: 1992 [2024-10-13 05:56:15,534 INFO L226 Difference]: Without dead ends: 1281 [2024-10-13 05:56:15,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2024-10-13 05:56:15,535 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 313 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:15,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1270 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 05:56:15,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2024-10-13 05:56:15,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 807. [2024-10-13 05:56:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 726 states have (on average 1.2603305785123966) internal successors, (915), 730 states have internal predecessors, (915), 62 states have call successors, (62), 18 states have call predecessors, (62), 18 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-13 05:56:15,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1039 transitions. [2024-10-13 05:56:15,567 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1039 transitions. Word has length 134 [2024-10-13 05:56:15,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:15,567 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1039 transitions. [2024-10-13 05:56:15,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.2) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-13 05:56:15,568 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1039 transitions. [2024-10-13 05:56:15,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 05:56:15,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:15,569 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:15,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 05:56:15,569 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:15,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:15,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1329483096, now seen corresponding path program 1 times [2024-10-13 05:56:15,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:15,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593916827] [2024-10-13 05:56:15,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:15,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:15,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:15,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:15,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:15,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:15,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:15,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:15,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:15,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:15,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:15,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:15,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:15,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:15,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:15,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:15,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:15,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:15,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:15,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:15,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593916827] [2024-10-13 05:56:15,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593916827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:15,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:15,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:56:15,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145842837] [2024-10-13 05:56:15,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:15,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:56:15,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:15,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:56:15,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:56:15,903 INFO L87 Difference]: Start difference. First operand 807 states and 1039 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:56:16,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:16,191 INFO L93 Difference]: Finished difference Result 1829 states and 2345 transitions. [2024-10-13 05:56:16,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:56:16,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-13 05:56:16,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:16,197 INFO L225 Difference]: With dead ends: 1829 [2024-10-13 05:56:16,197 INFO L226 Difference]: Without dead ends: 1022 [2024-10-13 05:56:16,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:56:16,199 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 57 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:16,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 614 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:56:16,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2024-10-13 05:56:16,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 894. [2024-10-13 05:56:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 813 states have (on average 1.2583025830258303) internal successors, (1023), 817 states have internal predecessors, (1023), 62 states have call successors, (62), 18 states have call predecessors, (62), 18 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-13 05:56:16,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1147 transitions. [2024-10-13 05:56:16,250 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1147 transitions. Word has length 134 [2024-10-13 05:56:16,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:16,250 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1147 transitions. [2024-10-13 05:56:16,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:56:16,250 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1147 transitions. [2024-10-13 05:56:16,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 05:56:16,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:16,252 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:16,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 05:56:16,252 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:16,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:16,253 INFO L85 PathProgramCache]: Analyzing trace with hash -97434644, now seen corresponding path program 1 times [2024-10-13 05:56:16,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:16,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337788087] [2024-10-13 05:56:16,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:16,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:16,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:16,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:16,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:16,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:16,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:16,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:16,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:16,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:16,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:16,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:16,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:16,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:16,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:16,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:16,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:16,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:16,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:16,621 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-13 05:56:16,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:16,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337788087] [2024-10-13 05:56:16,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337788087] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:56:16,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944418189] [2024-10-13 05:56:16,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:16,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:56:16,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:56:16,626 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 05:56:16,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 05:56:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:16,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 05:56:16,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:56:16,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-13 05:56:16,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-13 05:56:17,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-10-13 05:56:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 268 proven. 30 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-10-13 05:56:17,057 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:56:17,368 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-13 05:56:17,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944418189] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:56:17,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 05:56:17,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-13 05:56:17,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483149742] [2024-10-13 05:56:17,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 05:56:17,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 05:56:17,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:17,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 05:56:17,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-10-13 05:56:17,372 INFO L87 Difference]: Start difference. First operand 894 states and 1147 transitions. Second operand has 13 states, 10 states have (on average 7.9) internal successors, (79), 13 states have internal predecessors, (79), 6 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 3 states have call predecessors, (39), 6 states have call successors, (39) [2024-10-13 05:56:17,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:17,954 INFO L93 Difference]: Finished difference Result 1639 states and 2087 transitions. [2024-10-13 05:56:17,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 05:56:17,957 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 7.9) internal successors, (79), 13 states have internal predecessors, (79), 6 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 3 states have call predecessors, (39), 6 states have call successors, (39) Word has length 134 [2024-10-13 05:56:17,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:17,960 INFO L225 Difference]: With dead ends: 1639 [2024-10-13 05:56:17,960 INFO L226 Difference]: Without dead ends: 746 [2024-10-13 05:56:17,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2024-10-13 05:56:17,962 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 133 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:17,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 307 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 05:56:17,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-10-13 05:56:17,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 718. [2024-10-13 05:56:17,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 633 states have (on average 1.2401263823064772) internal successors, (785), 637 states have internal predecessors, (785), 62 states have call successors, (62), 22 states have call predecessors, (62), 22 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-13 05:56:17,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 909 transitions. [2024-10-13 05:56:17,999 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 909 transitions. Word has length 134 [2024-10-13 05:56:17,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:17,999 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 909 transitions. [2024-10-13 05:56:17,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 7.9) internal successors, (79), 13 states have internal predecessors, (79), 6 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 3 states have call predecessors, (39), 6 states have call successors, (39) [2024-10-13 05:56:18,000 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 909 transitions. [2024-10-13 05:56:18,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 05:56:18,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:18,001 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:18,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 05:56:18,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:56:18,202 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:18,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:18,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1290327162, now seen corresponding path program 1 times [2024-10-13 05:56:18,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:18,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608563723] [2024-10-13 05:56:18,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:18,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:19,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:19,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:19,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:19,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:19,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:19,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:19,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:19,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:19,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:19,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:19,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:19,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:19,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:19,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:19,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:19,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:19,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:19,263 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:19,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:19,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608563723] [2024-10-13 05:56:19,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608563723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:19,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:19,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:56:19,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172708934] [2024-10-13 05:56:19,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:19,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:56:19,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:19,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:56:19,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:56:19,266 INFO L87 Difference]: Start difference. First operand 718 states and 909 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:20,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:20,156 INFO L93 Difference]: Finished difference Result 1746 states and 2197 transitions. [2024-10-13 05:56:20,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:56:20,157 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2024-10-13 05:56:20,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:20,161 INFO L225 Difference]: With dead ends: 1746 [2024-10-13 05:56:20,161 INFO L226 Difference]: Without dead ends: 1029 [2024-10-13 05:56:20,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:56:20,163 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 307 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:20,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 483 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 05:56:20,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2024-10-13 05:56:20,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 796. [2024-10-13 05:56:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 699 states have (on average 1.2374821173104436) internal successors, (865), 705 states have internal predecessors, (865), 70 states have call successors, (70), 26 states have call predecessors, (70), 26 states have return successors, (70), 64 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 05:56:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1005 transitions. [2024-10-13 05:56:20,225 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1005 transitions. Word has length 134 [2024-10-13 05:56:20,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:20,226 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1005 transitions. [2024-10-13 05:56:20,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:20,226 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1005 transitions. [2024-10-13 05:56:20,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 05:56:20,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:20,227 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:20,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 05:56:20,228 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:20,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:20,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1820441519, now seen corresponding path program 1 times [2024-10-13 05:56:20,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:20,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554382970] [2024-10-13 05:56:20,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:20,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:20,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:20,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:20,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:20,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:20,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:20,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:20,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:20,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:20,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:20,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:20,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:20,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:20,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:20,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:20,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:20,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:20,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:20,517 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:20,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:20,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554382970] [2024-10-13 05:56:20,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554382970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:20,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:20,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 05:56:20,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859256980] [2024-10-13 05:56:20,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:20,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:56:20,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:20,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:56:20,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:56:20,520 INFO L87 Difference]: Start difference. First operand 796 states and 1005 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:56:20,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:20,804 INFO L93 Difference]: Finished difference Result 1754 states and 2210 transitions. [2024-10-13 05:56:20,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 05:56:20,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-13 05:56:20,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:20,809 INFO L225 Difference]: With dead ends: 1754 [2024-10-13 05:56:20,809 INFO L226 Difference]: Without dead ends: 959 [2024-10-13 05:56:20,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:56:20,811 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 53 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:20,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 790 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:56:20,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2024-10-13 05:56:20,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 836. [2024-10-13 05:56:20,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 739 states have (on average 1.243572395128552) internal successors, (919), 745 states have internal predecessors, (919), 70 states have call successors, (70), 26 states have call predecessors, (70), 26 states have return successors, (70), 64 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 05:56:20,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1059 transitions. [2024-10-13 05:56:20,889 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1059 transitions. Word has length 134 [2024-10-13 05:56:20,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:20,890 INFO L471 AbstractCegarLoop]: Abstraction has 836 states and 1059 transitions. [2024-10-13 05:56:20,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:56:20,890 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1059 transitions. [2024-10-13 05:56:20,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 05:56:20,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:20,892 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:20,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 05:56:20,893 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:20,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:20,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1137489959, now seen corresponding path program 1 times [2024-10-13 05:56:20,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:20,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264899815] [2024-10-13 05:56:20,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:20,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:21,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:21,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:21,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:21,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:21,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:21,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:21,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:21,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:21,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:21,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:21,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:21,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:21,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:21,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:21,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:21,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:21,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:21,594 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:21,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:21,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264899815] [2024-10-13 05:56:21,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264899815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:21,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:21,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:56:21,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750788198] [2024-10-13 05:56:21,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:21,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:56:21,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:21,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:56:21,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:56:21,596 INFO L87 Difference]: Start difference. First operand 836 states and 1059 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:56:21,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:21,918 INFO L93 Difference]: Finished difference Result 1730 states and 2183 transitions. [2024-10-13 05:56:21,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:56:21,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-13 05:56:21,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:21,923 INFO L225 Difference]: With dead ends: 1730 [2024-10-13 05:56:21,923 INFO L226 Difference]: Without dead ends: 895 [2024-10-13 05:56:21,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:56:21,925 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 45 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:21,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 384 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:56:21,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2024-10-13 05:56:21,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 771. [2024-10-13 05:56:22,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 684 states have (on average 1.236842105263158) internal successors, (846), 688 states have internal predecessors, (846), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-13 05:56:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 970 transitions. [2024-10-13 05:56:22,003 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 970 transitions. Word has length 135 [2024-10-13 05:56:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:22,003 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 970 transitions. [2024-10-13 05:56:22,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:56:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 970 transitions. [2024-10-13 05:56:22,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 05:56:22,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:22,005 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:22,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 05:56:22,005 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:22,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:22,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1071134778, now seen corresponding path program 1 times [2024-10-13 05:56:22,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:22,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348061228] [2024-10-13 05:56:22,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:22,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:22,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:22,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:22,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:22,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:22,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:22,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:22,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:22,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:22,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:22,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:22,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:22,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:22,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:22,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:22,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:22,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:22,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:22,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:22,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348061228] [2024-10-13 05:56:22,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348061228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:22,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:22,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 05:56:22,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754759939] [2024-10-13 05:56:22,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:22,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:56:22,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:22,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:56:22,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:56:22,395 INFO L87 Difference]: Start difference. First operand 771 states and 970 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:22,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:22,649 INFO L93 Difference]: Finished difference Result 1229 states and 1507 transitions. [2024-10-13 05:56:22,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 05:56:22,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2024-10-13 05:56:22,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:22,656 INFO L225 Difference]: With dead ends: 1229 [2024-10-13 05:56:22,657 INFO L226 Difference]: Without dead ends: 1227 [2024-10-13 05:56:22,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:56:22,660 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 65 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:22,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 816 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:56:22,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2024-10-13 05:56:22,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1223. [2024-10-13 05:56:22,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 1060 states have (on average 1.1971698113207547) internal successors, (1269), 1070 states have internal predecessors, (1269), 114 states have call successors, (114), 48 states have call predecessors, (114), 48 states have return successors, (114), 104 states have call predecessors, (114), 114 states have call successors, (114) [2024-10-13 05:56:22,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1497 transitions. [2024-10-13 05:56:22,781 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1497 transitions. Word has length 136 [2024-10-13 05:56:22,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:22,782 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1497 transitions. [2024-10-13 05:56:22,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:22,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1497 transitions. [2024-10-13 05:56:22,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 05:56:22,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:22,784 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:22,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 05:56:22,785 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:22,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:22,785 INFO L85 PathProgramCache]: Analyzing trace with hash 706219203, now seen corresponding path program 1 times [2024-10-13 05:56:22,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:22,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827270106] [2024-10-13 05:56:22,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:22,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:23,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:23,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:23,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:23,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:23,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:23,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:23,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:23,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:23,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:23,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:23,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:23,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:23,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:23,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:23,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:23,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:23,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:23,042 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:23,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:23,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827270106] [2024-10-13 05:56:23,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827270106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:23,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:23,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:56:23,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910722157] [2024-10-13 05:56:23,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:23,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:56:23,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:23,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:56:23,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:56:23,044 INFO L87 Difference]: Start difference. First operand 1223 states and 1497 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:23,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:23,236 INFO L93 Difference]: Finished difference Result 2689 states and 3289 transitions. [2024-10-13 05:56:23,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:56:23,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2024-10-13 05:56:23,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:23,247 INFO L225 Difference]: With dead ends: 2689 [2024-10-13 05:56:23,247 INFO L226 Difference]: Without dead ends: 1467 [2024-10-13 05:56:23,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:56:23,249 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 44 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:23,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 663 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:56:23,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2024-10-13 05:56:23,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1369. [2024-10-13 05:56:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1206 states have (on average 1.1923714759535655) internal successors, (1438), 1216 states have internal predecessors, (1438), 114 states have call successors, (114), 48 states have call predecessors, (114), 48 states have return successors, (114), 104 states have call predecessors, (114), 114 states have call successors, (114) [2024-10-13 05:56:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1666 transitions. [2024-10-13 05:56:23,359 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1666 transitions. Word has length 136 [2024-10-13 05:56:23,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:23,360 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1666 transitions. [2024-10-13 05:56:23,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:23,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1666 transitions. [2024-10-13 05:56:23,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 05:56:23,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:23,362 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:23,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 05:56:23,362 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:23,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:23,362 INFO L85 PathProgramCache]: Analyzing trace with hash 356710734, now seen corresponding path program 1 times [2024-10-13 05:56:23,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:23,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289384843] [2024-10-13 05:56:23,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:23,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:24,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:24,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:24,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:24,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:24,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:24,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:24,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:24,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:24,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:24,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:24,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:24,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:24,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:24,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:24,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:24,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:24,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:24,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:24,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289384843] [2024-10-13 05:56:24,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289384843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:24,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:24,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:56:24,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759989574] [2024-10-13 05:56:24,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:24,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:56:24,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:24,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:56:24,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:56:24,047 INFO L87 Difference]: Start difference. First operand 1369 states and 1666 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:56:24,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:24,574 INFO L93 Difference]: Finished difference Result 2910 states and 3518 transitions. [2024-10-13 05:56:24,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:56:24,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2024-10-13 05:56:24,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:24,583 INFO L225 Difference]: With dead ends: 2910 [2024-10-13 05:56:24,583 INFO L226 Difference]: Without dead ends: 1542 [2024-10-13 05:56:24,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:56:24,586 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 44 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:24,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 434 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:56:24,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2024-10-13 05:56:24,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1288. [2024-10-13 05:56:24,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1125 states have (on average 1.1591111111111112) internal successors, (1304), 1135 states have internal predecessors, (1304), 114 states have call successors, (114), 48 states have call predecessors, (114), 48 states have return successors, (114), 104 states have call predecessors, (114), 114 states have call successors, (114) [2024-10-13 05:56:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1532 transitions. [2024-10-13 05:56:24,728 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1532 transitions. Word has length 137 [2024-10-13 05:56:24,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:24,728 INFO L471 AbstractCegarLoop]: Abstraction has 1288 states and 1532 transitions. [2024-10-13 05:56:24,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 05:56:24,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1532 transitions. [2024-10-13 05:56:24,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 05:56:24,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:24,731 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:24,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-13 05:56:24,731 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:24,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:24,732 INFO L85 PathProgramCache]: Analyzing trace with hash -235527550, now seen corresponding path program 1 times [2024-10-13 05:56:24,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:24,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108681353] [2024-10-13 05:56:24,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:24,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,079 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:25,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:25,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108681353] [2024-10-13 05:56:25,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108681353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:25,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:25,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:56:25,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976972229] [2024-10-13 05:56:25,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:25,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:56:25,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:25,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:56:25,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:56:25,089 INFO L87 Difference]: Start difference. First operand 1288 states and 1532 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:25,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:25,315 INFO L93 Difference]: Finished difference Result 2243 states and 2684 transitions. [2024-10-13 05:56:25,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:56:25,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 137 [2024-10-13 05:56:25,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:25,320 INFO L225 Difference]: With dead ends: 2243 [2024-10-13 05:56:25,320 INFO L226 Difference]: Without dead ends: 912 [2024-10-13 05:56:25,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:56:25,324 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 103 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:25,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 367 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:56:25,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2024-10-13 05:56:25,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 910. [2024-10-13 05:56:25,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 767 states have (on average 1.151238591916558) internal successors, (883), 775 states have internal predecessors, (883), 100 states have call successors, (100), 42 states have call predecessors, (100), 42 states have return successors, (100), 92 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-13 05:56:25,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1083 transitions. [2024-10-13 05:56:25,420 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1083 transitions. Word has length 137 [2024-10-13 05:56:25,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:25,420 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1083 transitions. [2024-10-13 05:56:25,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:25,421 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1083 transitions. [2024-10-13 05:56:25,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-13 05:56:25,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:25,422 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:25,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-13 05:56:25,422 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:25,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:25,423 INFO L85 PathProgramCache]: Analyzing trace with hash 17111821, now seen corresponding path program 1 times [2024-10-13 05:56:25,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:25,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803165097] [2024-10-13 05:56:25,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:25,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:25,662 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:25,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:25,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803165097] [2024-10-13 05:56:25,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803165097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:25,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:25,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:56:25,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116575841] [2024-10-13 05:56:25,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:25,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:56:25,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:25,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:56:25,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:56:25,665 INFO L87 Difference]: Start difference. First operand 910 states and 1083 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:25,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:25,824 INFO L93 Difference]: Finished difference Result 1718 states and 2040 transitions. [2024-10-13 05:56:25,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:56:25,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2024-10-13 05:56:25,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:25,829 INFO L225 Difference]: With dead ends: 1718 [2024-10-13 05:56:25,829 INFO L226 Difference]: Without dead ends: 841 [2024-10-13 05:56:25,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:56:25,831 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 120 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:25,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 440 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:56:25,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2024-10-13 05:56:25,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 835. [2024-10-13 05:56:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 692 states have (on average 1.1358381502890174) internal successors, (786), 700 states have internal predecessors, (786), 100 states have call successors, (100), 42 states have call predecessors, (100), 42 states have return successors, (100), 92 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-13 05:56:25,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 986 transitions. [2024-10-13 05:56:25,923 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 986 transitions. Word has length 138 [2024-10-13 05:56:25,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:25,923 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 986 transitions. [2024-10-13 05:56:25,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:25,923 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 986 transitions. [2024-10-13 05:56:25,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 05:56:25,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:25,925 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:25,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-13 05:56:25,925 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:25,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:25,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1021407447, now seen corresponding path program 1 times [2024-10-13 05:56:25,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:25,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570504743] [2024-10-13 05:56:25,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:25,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:26,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:26,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:26,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:26,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:26,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:26,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:26,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:26,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:26,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:26,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:26,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:26,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:26,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:26,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:26,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:26,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:26,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:26,190 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:26,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:26,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570504743] [2024-10-13 05:56:26,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570504743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:26,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:26,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:56:26,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340104678] [2024-10-13 05:56:26,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:26,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:56:26,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:26,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:56:26,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:56:26,193 INFO L87 Difference]: Start difference. First operand 835 states and 986 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:26,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:26,357 INFO L93 Difference]: Finished difference Result 1601 states and 1881 transitions. [2024-10-13 05:56:26,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:56:26,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2024-10-13 05:56:26,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:26,362 INFO L225 Difference]: With dead ends: 1601 [2024-10-13 05:56:26,362 INFO L226 Difference]: Without dead ends: 799 [2024-10-13 05:56:26,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:56:26,364 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 57 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:26,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 420 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:56:26,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-10-13 05:56:26,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2024-10-13 05:56:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 656 states have (on average 1.1067073170731707) internal successors, (726), 664 states have internal predecessors, (726), 100 states have call successors, (100), 42 states have call predecessors, (100), 42 states have return successors, (100), 92 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-13 05:56:26,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 926 transitions. [2024-10-13 05:56:26,453 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 926 transitions. Word has length 139 [2024-10-13 05:56:26,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:26,454 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 926 transitions. [2024-10-13 05:56:26,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 05:56:26,454 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 926 transitions. [2024-10-13 05:56:26,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 05:56:26,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:26,455 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:26,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-13 05:56:26,456 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:26,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:26,456 INFO L85 PathProgramCache]: Analyzing trace with hash 383738798, now seen corresponding path program 1 times [2024-10-13 05:56:26,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:26,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341423958] [2024-10-13 05:56:26,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:26,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:27,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:56:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:27,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:56:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:27,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:56:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:27,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:56:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:27,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 05:56:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:27,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 05:56:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:27,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:56:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:27,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:56:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:27,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:56:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:27,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:56:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:27,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:56:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:27,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:56:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:27,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:56:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:27,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:56:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:27,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:56:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:27,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:56:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:27,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 05:56:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:56:27,559 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 05:56:27,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:56:27,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341423958] [2024-10-13 05:56:27,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341423958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:56:27,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:56:27,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:56:27,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088838278] [2024-10-13 05:56:27,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:56:27,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:56:27,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:56:27,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:56:27,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:56:27,561 INFO L87 Difference]: Start difference. First operand 799 states and 926 transitions. Second operand has 9 states, 7 states have (on average 8.142857142857142) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-13 05:56:27,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:56:27,970 INFO L93 Difference]: Finished difference Result 1035 states and 1201 transitions. [2024-10-13 05:56:27,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:56:27,971 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.142857142857142) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 139 [2024-10-13 05:56:27,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:56:27,976 INFO L225 Difference]: With dead ends: 1035 [2024-10-13 05:56:27,976 INFO L226 Difference]: Without dead ends: 1033 [2024-10-13 05:56:27,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-13 05:56:27,977 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 63 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:56:27,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1176 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:56:27,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2024-10-13 05:56:28,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1029. [2024-10-13 05:56:28,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 842 states have (on average 1.1092636579572446) internal successors, (934), 853 states have internal predecessors, (934), 130 states have call successors, (130), 56 states have call predecessors, (130), 56 states have return successors, (130), 119 states have call predecessors, (130), 130 states have call successors, (130) [2024-10-13 05:56:28,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1194 transitions. [2024-10-13 05:56:28,107 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1194 transitions. Word has length 139 [2024-10-13 05:56:28,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:56:28,108 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1194 transitions. [2024-10-13 05:56:28,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.142857142857142) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-13 05:56:28,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1194 transitions. [2024-10-13 05:56:28,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 05:56:28,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:56:28,109 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:56:28,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-13 05:56:28,110 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:56:28,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:56:28,110 INFO L85 PathProgramCache]: Analyzing trace with hash 440997100, now seen corresponding path program 1 times [2024-10-13 05:56:28,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:56:28,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683496762] [2024-10-13 05:56:28,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:56:28,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:56:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat