./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-5.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 e5cd17eaa72b9521fda898a2a986ee0938b4ad224ba1d7e3a176f1730b240d26 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:20:58,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:20:58,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:20:58,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:20:58,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:20:58,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:20:58,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:20:58,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:20:58,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:20:58,301 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:20:58,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:20:58,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:20:58,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:20:58,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:20:58,305 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:20:58,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:20:58,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:20:58,306 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:20:58,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:20:58,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:20:58,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:20:58,307 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:20:58,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:20:58,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:20:58,307 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:20:58,308 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:20:58,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:20:58,308 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:20:58,308 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:20:58,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:20:58,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:20:58,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:20:58,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:20:58,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:20:58,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:20:58,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:20:58,310 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:20:58,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:20:58,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:20:58,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:20:58,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:20:58,311 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:20:58,311 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 -> e5cd17eaa72b9521fda898a2a986ee0938b4ad224ba1d7e3a176f1730b240d26 [2024-11-12 07:20:58,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:20:58,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:20:58,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:20:58,525 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:20:58,525 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:20:58,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-5.i [2024-11-12 07:20:59,771 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:20:59,951 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:20:59,951 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-5.i [2024-11-12 07:20:59,958 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c48e2a46/730b42467a704b968c0ba78092c88b99/FLAG74c52309b [2024-11-12 07:21:00,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c48e2a46/730b42467a704b968c0ba78092c88b99 [2024-11-12 07:21:00,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:21:00,343 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:21:00,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:21:00,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:21:00,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:21:00,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:21:00" (1/1) ... [2024-11-12 07:21:00,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b2360a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:21:00, skipping insertion in model container [2024-11-12 07:21:00,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:21:00" (1/1) ... [2024-11-12 07:21:00,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:21:00,550 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-5.i[916,929] [2024-11-12 07:21:00,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:21:00,610 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:21:00,619 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-5.i[916,929] [2024-11-12 07:21:00,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:21:00,670 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:21:00,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:21:00 WrapperNode [2024-11-12 07:21:00,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:21:00,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:21:00,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:21:00,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:21:00,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:21:00" (1/1) ... [2024-11-12 07:21:00,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:21:00" (1/1) ... [2024-11-12 07:21:00,722 INFO L138 Inliner]: procedures = 26, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 433 [2024-11-12 07:21:00,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:21:00,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:21:00,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:21:00,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:21:00,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:21:00" (1/1) ... [2024-11-12 07:21:00,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:21:00" (1/1) ... [2024-11-12 07:21:00,738 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:21:00" (1/1) ... [2024-11-12 07:21:00,761 INFO L175 MemorySlicer]: Split 122 memory accesses to 6 slices as follows [2, 6, 3, 28, 59, 24]. 48 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 6, 4, 3]. The 17 writes are split as follows [0, 1, 1, 6, 6, 3]. [2024-11-12 07:21:00,761 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:21:00" (1/1) ... [2024-11-12 07:21:00,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:21:00" (1/1) ... [2024-11-12 07:21:00,773 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:21:00" (1/1) ... [2024-11-12 07:21:00,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:21:00" (1/1) ... [2024-11-12 07:21:00,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:21:00" (1/1) ... [2024-11-12 07:21:00,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:21:00" (1/1) ... [2024-11-12 07:21:00,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:21:00,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:21:00,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:21:00,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:21:00,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:21:00" (1/1) ... [2024-11-12 07:21:00,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:21:00,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:21:00,838 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 07:21:00,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 07:21:00,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:21:00,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 07:21:00,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 07:21:00,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 07:21:00,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 07:21:00,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-12 07:21:00,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-12 07:21:00,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 07:21:00,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 07:21:00,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 07:21:00,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 07:21:00,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-12 07:21:00,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-12 07:21:00,888 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:21:00,888 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:21:00,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 07:21:00,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 07:21:00,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 07:21:00,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 07:21:00,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-12 07:21:00,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-12 07:21:00,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:21:00,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:21:01,014 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:21:01,016 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:21:01,404 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-12 07:21:01,404 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:21:01,421 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:21:01,422 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:21:01,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:21:01 BoogieIcfgContainer [2024-11-12 07:21:01,422 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:21:01,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:21:01,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:21:01,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:21:01,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:21:00" (1/3) ... [2024-11-12 07:21:01,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a1ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:21:01, skipping insertion in model container [2024-11-12 07:21:01,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:21:00" (2/3) ... [2024-11-12 07:21:01,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a1ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:21:01, skipping insertion in model container [2024-11-12 07:21:01,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:21:01" (3/3) ... [2024-11-12 07:21:01,429 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-5.i [2024-11-12 07:21:01,442 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:21:01,442 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:21:01,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:21:01,501 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;@3c6cc3e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:21:01,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:21:01,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 74 states have internal predecessors, (97), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:21:01,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 07:21:01,515 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:01,515 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:01,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:01,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:01,521 INFO L85 PathProgramCache]: Analyzing trace with hash 779273670, now seen corresponding path program 1 times [2024-11-12 07:21:01,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:01,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043064306] [2024-11-12 07:21:01,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:01,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:01,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:01,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:01,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:01,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:01,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:01,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:01,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:01,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:01,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:01,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:01,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:01,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:01,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:01,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:01,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:01,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:01,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:01,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:01,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:01,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,006 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:02,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:02,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043064306] [2024-11-12 07:21:02,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043064306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:02,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:02,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:21:02,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253761007] [2024-11-12 07:21:02,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:02,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:21:02,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:02,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:21:02,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:21:02,033 INFO L87 Difference]: Start difference. First operand has 96 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 74 states have internal predecessors, (97), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:21:02,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:02,054 INFO L93 Difference]: Finished difference Result 185 states and 288 transitions. [2024-11-12 07:21:02,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:21:02,056 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 148 [2024-11-12 07:21:02,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:02,062 INFO L225 Difference]: With dead ends: 185 [2024-11-12 07:21:02,062 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 07:21:02,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:21:02,068 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:02,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:21:02,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 07:21:02,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-12 07:21:02,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:21:02,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2024-11-12 07:21:02,107 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 148 [2024-11-12 07:21:02,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:02,108 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2024-11-12 07:21:02,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:21:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2024-11-12 07:21:02,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 07:21:02,112 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:02,112 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:02,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:21:02,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:02,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:02,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1856104722, now seen corresponding path program 1 times [2024-11-12 07:21:02,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:02,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654363566] [2024-11-12 07:21:02,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:02,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,510 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:02,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:02,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654363566] [2024-11-12 07:21:02,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654363566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:02,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:02,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:21:02,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463339113] [2024-11-12 07:21:02,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:02,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:21:02,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:02,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:21:02,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:21:02,515 INFO L87 Difference]: Start difference. First operand 92 states and 130 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:02,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:02,557 INFO L93 Difference]: Finished difference Result 183 states and 260 transitions. [2024-11-12 07:21:02,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:21:02,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2024-11-12 07:21:02,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:02,560 INFO L225 Difference]: With dead ends: 183 [2024-11-12 07:21:02,560 INFO L226 Difference]: Without dead ends: 94 [2024-11-12 07:21:02,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:21:02,565 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:02,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 373 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:21:02,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-12 07:21:02,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-12 07:21:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 72 states have internal predecessors, (92), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:21:02,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2024-11-12 07:21:02,585 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 148 [2024-11-12 07:21:02,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:02,586 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2024-11-12 07:21:02,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:02,587 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2024-11-12 07:21:02,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-12 07:21:02,590 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:02,591 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:02,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:21:02,591 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:02,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:02,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1733069801, now seen corresponding path program 1 times [2024-11-12 07:21:02,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:02,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518746479] [2024-11-12 07:21:02,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:02,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,810 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:02,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:02,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518746479] [2024-11-12 07:21:02,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518746479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:02,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:02,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:21:02,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490789935] [2024-11-12 07:21:02,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:02,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:21:02,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:02,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:21:02,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:21:02,815 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:02,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:02,856 INFO L93 Difference]: Finished difference Result 188 states and 265 transitions. [2024-11-12 07:21:02,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:21:02,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-12 07:21:02,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:02,858 INFO L225 Difference]: With dead ends: 188 [2024-11-12 07:21:02,858 INFO L226 Difference]: Without dead ends: 97 [2024-11-12 07:21:02,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:21:02,860 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:02,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 370 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:21:02,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-12 07:21:02,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-11-12 07:21:02,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:21:02,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2024-11-12 07:21:02,877 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 150 [2024-11-12 07:21:02,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:02,878 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2024-11-12 07:21:02,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:02,879 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2024-11-12 07:21:02,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-12 07:21:02,881 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:02,881 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:02,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:21:02,881 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:02,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:02,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1881839125, now seen corresponding path program 1 times [2024-11-12 07:21:02,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:02,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520506613] [2024-11-12 07:21:02,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:02,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:02,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:03,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:03,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520506613] [2024-11-12 07:21:03,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520506613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:03,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:03,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:21:03,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102415813] [2024-11-12 07:21:03,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:03,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:21:03,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:03,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:21:03,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:21:03,045 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:03,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:03,073 INFO L93 Difference]: Finished difference Result 192 states and 269 transitions. [2024-11-12 07:21:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:21:03,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-12 07:21:03,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:03,075 INFO L225 Difference]: With dead ends: 192 [2024-11-12 07:21:03,075 INFO L226 Difference]: Without dead ends: 99 [2024-11-12 07:21:03,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:21:03,076 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:03,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 371 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:21:03,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-12 07:21:03,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-11-12 07:21:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.263157894736842) internal successors, (96), 76 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:21:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2024-11-12 07:21:03,083 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 150 [2024-11-12 07:21:03,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:03,083 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2024-11-12 07:21:03,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:03,083 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2024-11-12 07:21:03,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-12 07:21:03,084 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:03,085 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:03,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:21:03,085 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:03,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:03,085 INFO L85 PathProgramCache]: Analyzing trace with hash -106831763, now seen corresponding path program 1 times [2024-11-12 07:21:03,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:03,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368465129] [2024-11-12 07:21:03,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:03,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,227 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:03,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:03,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368465129] [2024-11-12 07:21:03,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368465129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:03,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:03,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:21:03,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480101546] [2024-11-12 07:21:03,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:03,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:21:03,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:03,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:21:03,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:21:03,230 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:03,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:03,253 INFO L93 Difference]: Finished difference Result 196 states and 273 transitions. [2024-11-12 07:21:03,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:21:03,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-12 07:21:03,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:03,255 INFO L225 Difference]: With dead ends: 196 [2024-11-12 07:21:03,255 INFO L226 Difference]: Without dead ends: 101 [2024-11-12 07:21:03,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:21:03,258 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:03,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 373 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:21:03,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-12 07:21:03,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-12 07:21:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 78 states have internal predecessors, (98), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:21:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2024-11-12 07:21:03,265 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 150 [2024-11-12 07:21:03,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:03,266 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2024-11-12 07:21:03,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2024-11-12 07:21:03,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-12 07:21:03,267 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:03,267 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:03,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:21:03,268 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:03,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:03,268 INFO L85 PathProgramCache]: Analyzing trace with hash -104984721, now seen corresponding path program 1 times [2024-11-12 07:21:03,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:03,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561766863] [2024-11-12 07:21:03,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:03,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,616 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:03,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:03,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561766863] [2024-11-12 07:21:03,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561766863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:03,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:03,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:21:03,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088881345] [2024-11-12 07:21:03,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:03,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:21:03,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:03,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:21:03,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:21:03,618 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:03,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:03,671 INFO L93 Difference]: Finished difference Result 197 states and 273 transitions. [2024-11-12 07:21:03,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:21:03,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-12 07:21:03,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:03,672 INFO L225 Difference]: With dead ends: 197 [2024-11-12 07:21:03,672 INFO L226 Difference]: Without dead ends: 100 [2024-11-12 07:21:03,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:21:03,674 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:03,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:21:03,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-12 07:21:03,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-12 07:21:03,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 78 states have internal predecessors, (97), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:21:03,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 137 transitions. [2024-11-12 07:21:03,685 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 137 transitions. Word has length 150 [2024-11-12 07:21:03,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:03,686 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 137 transitions. [2024-11-12 07:21:03,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:03,686 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 137 transitions. [2024-11-12 07:21:03,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-12 07:21:03,687 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:03,687 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:03,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 07:21:03,687 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:03,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:03,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1126053075, now seen corresponding path program 1 times [2024-11-12 07:21:03,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:03,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203571851] [2024-11-12 07:21:03,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:03,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:03,927 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:03,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:03,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203571851] [2024-11-12 07:21:03,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203571851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:03,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:03,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:21:03,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433187630] [2024-11-12 07:21:03,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:03,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:21:03,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:03,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:21:03,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:21:03,930 INFO L87 Difference]: Start difference. First operand 100 states and 137 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:03,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:03,939 INFO L93 Difference]: Finished difference Result 197 states and 271 transitions. [2024-11-12 07:21:03,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:21:03,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-12 07:21:03,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:03,942 INFO L225 Difference]: With dead ends: 197 [2024-11-12 07:21:03,942 INFO L226 Difference]: Without dead ends: 100 [2024-11-12 07:21:03,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:21:03,943 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 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-11-12 07:21:03,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:21:03,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-12 07:21:03,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-12 07:21:03,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 78 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:21:03,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 136 transitions. [2024-11-12 07:21:03,951 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 136 transitions. Word has length 150 [2024-11-12 07:21:03,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:03,951 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 136 transitions. [2024-11-12 07:21:03,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:03,951 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 136 transitions. [2024-11-12 07:21:03,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-12 07:21:03,952 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:03,952 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:03,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 07:21:03,953 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:03,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:03,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1163211282, now seen corresponding path program 1 times [2024-11-12 07:21:03,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:03,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127357629] [2024-11-12 07:21:03,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:03,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:04,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:04,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:04,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:04,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:04,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:04,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:04,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:04,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:04,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:04,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:04,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:04,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:04,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:04,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:04,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:04,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:04,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:04,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:04,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:04,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:04,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:04,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127357629] [2024-11-12 07:21:04,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127357629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:04,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:04,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:21:04,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856847895] [2024-11-12 07:21:04,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:04,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:21:04,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:04,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:21:04,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:21:04,228 INFO L87 Difference]: Start difference. First operand 100 states and 136 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:04,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:04,279 INFO L93 Difference]: Finished difference Result 197 states and 269 transitions. [2024-11-12 07:21:04,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:21:04,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2024-11-12 07:21:04,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:04,281 INFO L225 Difference]: With dead ends: 197 [2024-11-12 07:21:04,281 INFO L226 Difference]: Without dead ends: 100 [2024-11-12 07:21:04,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:21:04,282 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:04,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 340 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:21:04,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-12 07:21:04,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-12 07:21:04,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.2179487179487178) internal successors, (95), 78 states have internal predecessors, (95), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:21:04,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 135 transitions. [2024-11-12 07:21:04,290 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 135 transitions. Word has length 152 [2024-11-12 07:21:04,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:04,290 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 135 transitions. [2024-11-12 07:21:04,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:04,290 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 135 transitions. [2024-11-12 07:21:04,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-12 07:21:04,291 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:04,293 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:04,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 07:21:04,293 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:04,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:04,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1585913108, now seen corresponding path program 1 times [2024-11-12 07:21:04,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:04,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653388159] [2024-11-12 07:21:04,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:04,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:06,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:06,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:06,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:06,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:06,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:06,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:06,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:06,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:06,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:06,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:06,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:06,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:06,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:06,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:06,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:06,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:06,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:06,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:06,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:06,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:06,299 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:06,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:06,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653388159] [2024-11-12 07:21:06,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653388159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:06,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:06,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 07:21:06,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592563805] [2024-11-12 07:21:06,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:06,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 07:21:06,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:06,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 07:21:06,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:21:06,302 INFO L87 Difference]: Start difference. First operand 100 states and 135 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:21:07,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:07,083 INFO L93 Difference]: Finished difference Result 304 states and 410 transitions. [2024-11-12 07:21:07,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 07:21:07,086 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 152 [2024-11-12 07:21:07,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:07,087 INFO L225 Difference]: With dead ends: 304 [2024-11-12 07:21:07,088 INFO L226 Difference]: Without dead ends: 207 [2024-11-12 07:21:07,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2024-11-12 07:21:07,088 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 194 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:07,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 830 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:21:07,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-12 07:21:07,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 200. [2024-11-12 07:21:07,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 154 states have (on average 1.2012987012987013) internal successors, (185), 155 states have internal predecessors, (185), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-12 07:21:07,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 269 transitions. [2024-11-12 07:21:07,107 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 269 transitions. Word has length 152 [2024-11-12 07:21:07,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:07,108 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 269 transitions. [2024-11-12 07:21:07,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:21:07,108 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 269 transitions. [2024-11-12 07:21:07,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-12 07:21:07,110 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:07,110 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:07,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 07:21:07,110 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:07,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:07,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2129939654, now seen corresponding path program 1 times [2024-11-12 07:21:07,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:07,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29552447] [2024-11-12 07:21:07,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:07,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:07,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:07,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:07,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:07,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:07,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:07,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:07,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:07,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:07,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:07,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:07,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:07,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:07,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:07,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:07,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:07,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:07,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:07,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:07,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:07,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:07,292 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:07,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:07,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29552447] [2024-11-12 07:21:07,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29552447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:07,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:07,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:21:07,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264311528] [2024-11-12 07:21:07,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:07,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:21:07,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:07,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:21:07,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:21:07,294 INFO L87 Difference]: Start difference. First operand 200 states and 269 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:07,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:07,329 INFO L93 Difference]: Finished difference Result 398 states and 536 transitions. [2024-11-12 07:21:07,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:21:07,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2024-11-12 07:21:07,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:07,333 INFO L225 Difference]: With dead ends: 398 [2024-11-12 07:21:07,333 INFO L226 Difference]: Without dead ends: 206 [2024-11-12 07:21:07,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:21:07,334 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:07,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:21:07,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-12 07:21:07,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2024-11-12 07:21:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 160 states have (on average 1.19375) internal successors, (191), 161 states have internal predecessors, (191), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-12 07:21:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 275 transitions. [2024-11-12 07:21:07,349 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 275 transitions. Word has length 152 [2024-11-12 07:21:07,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:07,350 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 275 transitions. [2024-11-12 07:21:07,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:07,350 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 275 transitions. [2024-11-12 07:21:07,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-12 07:21:07,351 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:07,351 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:07,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 07:21:07,352 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:07,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:07,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1295740087, now seen corresponding path program 1 times [2024-11-12 07:21:07,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:07,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088434112] [2024-11-12 07:21:07,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:07,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:08,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:08,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:08,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:08,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:08,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:08,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:08,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:08,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:08,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:08,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:08,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:08,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:08,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:08,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:08,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:08,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:08,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:08,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:08,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:08,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:08,688 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:08,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:08,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088434112] [2024-11-12 07:21:08,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088434112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:08,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:08,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 07:21:08,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715531754] [2024-11-12 07:21:08,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:08,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 07:21:08,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:08,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 07:21:08,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:21:08,691 INFO L87 Difference]: Start difference. First operand 206 states and 275 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:21:09,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:09,199 INFO L93 Difference]: Finished difference Result 311 states and 414 transitions. [2024-11-12 07:21:09,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 07:21:09,199 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 153 [2024-11-12 07:21:09,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:09,201 INFO L225 Difference]: With dead ends: 311 [2024-11-12 07:21:09,201 INFO L226 Difference]: Without dead ends: 211 [2024-11-12 07:21:09,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2024-11-12 07:21:09,202 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 154 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:09,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 678 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:21:09,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-12 07:21:09,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2024-11-12 07:21:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 161 states have (on average 1.186335403726708) internal successors, (191), 162 states have internal predecessors, (191), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-12 07:21:09,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 275 transitions. [2024-11-12 07:21:09,224 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 275 transitions. Word has length 153 [2024-11-12 07:21:09,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:09,225 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 275 transitions. [2024-11-12 07:21:09,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:21:09,225 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 275 transitions. [2024-11-12 07:21:09,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-12 07:21:09,227 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:09,227 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:09,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 07:21:09,227 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:09,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:09,227 INFO L85 PathProgramCache]: Analyzing trace with hash 482934228, now seen corresponding path program 1 times [2024-11-12 07:21:09,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:09,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759808169] [2024-11-12 07:21:09,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:09,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,414 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:09,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:09,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759808169] [2024-11-12 07:21:09,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759808169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:09,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:09,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:21:09,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729393478] [2024-11-12 07:21:09,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:09,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:21:09,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:09,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:21:09,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:21:09,416 INFO L87 Difference]: Start difference. First operand 208 states and 275 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:09,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:09,460 INFO L93 Difference]: Finished difference Result 440 states and 578 transitions. [2024-11-12 07:21:09,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:21:09,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2024-11-12 07:21:09,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:09,462 INFO L225 Difference]: With dead ends: 440 [2024-11-12 07:21:09,462 INFO L226 Difference]: Without dead ends: 240 [2024-11-12 07:21:09,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 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-11-12 07:21:09,463 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 36 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:09,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 472 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:21:09,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-12 07:21:09,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 215. [2024-11-12 07:21:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 168 states have (on average 1.1726190476190477) internal successors, (197), 169 states have internal predecessors, (197), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-12 07:21:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 281 transitions. [2024-11-12 07:21:09,483 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 281 transitions. Word has length 154 [2024-11-12 07:21:09,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:09,484 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 281 transitions. [2024-11-12 07:21:09,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 281 transitions. [2024-11-12 07:21:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-12 07:21:09,485 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:09,485 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:09,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 07:21:09,486 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:09,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:09,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1665361070, now seen corresponding path program 1 times [2024-11-12 07:21:09,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:09,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211369074] [2024-11-12 07:21:09,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:09,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:09,817 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:09,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:09,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211369074] [2024-11-12 07:21:09,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211369074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:09,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:09,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:21:09,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773882106] [2024-11-12 07:21:09,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:09,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:21:09,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:09,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:21:09,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:21:09,819 INFO L87 Difference]: Start difference. First operand 215 states and 281 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:09,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:09,898 INFO L93 Difference]: Finished difference Result 422 states and 552 transitions. [2024-11-12 07:21:09,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:21:09,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 154 [2024-11-12 07:21:09,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:09,900 INFO L225 Difference]: With dead ends: 422 [2024-11-12 07:21:09,900 INFO L226 Difference]: Without dead ends: 215 [2024-11-12 07:21:09,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:21:09,901 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:09,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 439 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:21:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-12 07:21:09,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-11-12 07:21:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 168 states have (on average 1.1547619047619047) internal successors, (194), 169 states have internal predecessors, (194), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-12 07:21:09,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 278 transitions. [2024-11-12 07:21:09,922 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 278 transitions. Word has length 154 [2024-11-12 07:21:09,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:09,922 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 278 transitions. [2024-11-12 07:21:09,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:09,922 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 278 transitions. [2024-11-12 07:21:09,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-12 07:21:09,923 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:09,923 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:09,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 07:21:09,924 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:09,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:09,924 INFO L85 PathProgramCache]: Analyzing trace with hash 119101899, now seen corresponding path program 1 times [2024-11-12 07:21:09,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:09,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813865508] [2024-11-12 07:21:09,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:09,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:10,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:10,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:10,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:10,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:10,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:10,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:10,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:10,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:10,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:10,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:10,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:10,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:10,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:10,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:10,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:10,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:10,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:10,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:10,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:10,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:10,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:10,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813865508] [2024-11-12 07:21:10,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813865508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:10,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:10,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:21:10,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498579537] [2024-11-12 07:21:10,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:10,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:21:10,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:10,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:21:10,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:21:10,341 INFO L87 Difference]: Start difference. First operand 215 states and 278 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:10,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:10,462 INFO L93 Difference]: Finished difference Result 224 states and 288 transitions. [2024-11-12 07:21:10,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:21:10,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2024-11-12 07:21:10,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:10,463 INFO L225 Difference]: With dead ends: 224 [2024-11-12 07:21:10,463 INFO L226 Difference]: Without dead ends: 222 [2024-11-12 07:21:10,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 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-11-12 07:21:10,464 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 35 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:10,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 530 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:21:10,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-12 07:21:10,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2024-11-12 07:21:10,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 174 states have (on average 1.1494252873563218) internal successors, (200), 175 states have internal predecessors, (200), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-12 07:21:10,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 284 transitions. [2024-11-12 07:21:10,483 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 284 transitions. Word has length 156 [2024-11-12 07:21:10,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:10,484 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 284 transitions. [2024-11-12 07:21:10,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:10,484 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 284 transitions. [2024-11-12 07:21:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-12 07:21:10,485 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:10,485 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:10,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 07:21:10,485 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:10,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:10,486 INFO L85 PathProgramCache]: Analyzing trace with hash 120948941, now seen corresponding path program 1 times [2024-11-12 07:21:10,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:10,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264234223] [2024-11-12 07:21:10,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:10,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:11,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:11,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:11,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:11,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:11,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:11,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:11,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:11,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:11,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:11,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:11,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:11,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:11,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:11,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:11,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:11,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:11,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:11,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:11,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:11,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:11,411 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:11,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:11,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264234223] [2024-11-12 07:21:11,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264234223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:11,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:11,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:21:11,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448532037] [2024-11-12 07:21:11,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:11,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:21:11,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:11,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:21:11,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:21:11,413 INFO L87 Difference]: Start difference. First operand 221 states and 284 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:21:11,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:11,797 INFO L93 Difference]: Finished difference Result 439 states and 564 transitions. [2024-11-12 07:21:11,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:21:11,797 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 156 [2024-11-12 07:21:11,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:11,799 INFO L225 Difference]: With dead ends: 439 [2024-11-12 07:21:11,799 INFO L226 Difference]: Without dead ends: 226 [2024-11-12 07:21:11,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:21:11,800 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 174 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:11,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 571 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:21:11,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-12 07:21:11,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 221. [2024-11-12 07:21:11,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 174 states have (on average 1.1436781609195403) internal successors, (199), 175 states have internal predecessors, (199), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-12 07:21:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 283 transitions. [2024-11-12 07:21:11,818 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 283 transitions. Word has length 156 [2024-11-12 07:21:11,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:11,818 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 283 transitions. [2024-11-12 07:21:11,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:21:11,818 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 283 transitions. [2024-11-12 07:21:11,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-12 07:21:11,819 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:11,819 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:11,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 07:21:11,820 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:11,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:11,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1895956303, now seen corresponding path program 1 times [2024-11-12 07:21:11,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:11,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683301784] [2024-11-12 07:21:11,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:11,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:12,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:12,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683301784] [2024-11-12 07:21:12,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683301784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:12,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:12,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:21:12,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395912334] [2024-11-12 07:21:12,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:12,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:21:12,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:12,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:21:12,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:21:12,102 INFO L87 Difference]: Start difference. First operand 221 states and 283 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:12,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:12,160 INFO L93 Difference]: Finished difference Result 497 states and 643 transitions. [2024-11-12 07:21:12,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:21:12,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2024-11-12 07:21:12,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:12,162 INFO L225 Difference]: With dead ends: 497 [2024-11-12 07:21:12,162 INFO L226 Difference]: Without dead ends: 284 [2024-11-12 07:21:12,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:21:12,164 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 109 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:12,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 686 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:21:12,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-12 07:21:12,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 261. [2024-11-12 07:21:12,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 195 states have (on average 1.117948717948718) internal successors, (218), 196 states have internal predecessors, (218), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-12 07:21:12,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 338 transitions. [2024-11-12 07:21:12,188 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 338 transitions. Word has length 156 [2024-11-12 07:21:12,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:12,189 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 338 transitions. [2024-11-12 07:21:12,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:12,189 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 338 transitions. [2024-11-12 07:21:12,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-12 07:21:12,190 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:12,190 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:12,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 07:21:12,190 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:12,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:12,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1718952623, now seen corresponding path program 1 times [2024-11-12 07:21:12,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:12,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339025306] [2024-11-12 07:21:12,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:12,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:12,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:12,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339025306] [2024-11-12 07:21:12,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339025306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:12,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:12,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:21:12,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966948501] [2024-11-12 07:21:12,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:12,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:21:12,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:12,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:21:12,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:21:12,339 INFO L87 Difference]: Start difference. First operand 261 states and 338 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:12,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:12,377 INFO L93 Difference]: Finished difference Result 480 states and 617 transitions. [2024-11-12 07:21:12,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:21:12,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2024-11-12 07:21:12,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:12,379 INFO L225 Difference]: With dead ends: 480 [2024-11-12 07:21:12,379 INFO L226 Difference]: Without dead ends: 267 [2024-11-12 07:21:12,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:21:12,380 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:12,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 472 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:21:12,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-12 07:21:12,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-11-12 07:21:12,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 201 states have (on average 1.1144278606965174) internal successors, (224), 202 states have internal predecessors, (224), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-12 07:21:12,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 344 transitions. [2024-11-12 07:21:12,404 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 344 transitions. Word has length 156 [2024-11-12 07:21:12,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:12,404 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 344 transitions. [2024-11-12 07:21:12,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:12,405 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 344 transitions. [2024-11-12 07:21:12,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-12 07:21:12,405 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:12,406 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:12,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 07:21:12,406 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:12,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:12,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1578336880, now seen corresponding path program 1 times [2024-11-12 07:21:12,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:12,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207158515] [2024-11-12 07:21:12,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:12,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,109 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:13,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:13,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207158515] [2024-11-12 07:21:13,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207158515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:13,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:13,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:21:13,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045053631] [2024-11-12 07:21:13,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:13,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 07:21:13,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:13,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 07:21:13,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:21:13,111 INFO L87 Difference]: Start difference. First operand 267 states and 344 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:21:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:13,549 INFO L93 Difference]: Finished difference Result 450 states and 571 transitions. [2024-11-12 07:21:13,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 07:21:13,550 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 157 [2024-11-12 07:21:13,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:13,552 INFO L225 Difference]: With dead ends: 450 [2024-11-12 07:21:13,552 INFO L226 Difference]: Without dead ends: 326 [2024-11-12 07:21:13,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2024-11-12 07:21:13,553 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 215 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:13,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 792 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:21:13,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-12 07:21:13,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 320. [2024-11-12 07:21:13,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 244 states have (on average 1.1147540983606556) internal successors, (272), 246 states have internal predecessors, (272), 68 states have call successors, (68), 7 states have call predecessors, (68), 7 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-12 07:21:13,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 408 transitions. [2024-11-12 07:21:13,586 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 408 transitions. Word has length 157 [2024-11-12 07:21:13,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:13,586 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 408 transitions. [2024-11-12 07:21:13,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:21:13,587 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 408 transitions. [2024-11-12 07:21:13,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-12 07:21:13,587 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:13,587 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:13,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 07:21:13,588 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:13,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:13,588 INFO L85 PathProgramCache]: Analyzing trace with hash -568111376, now seen corresponding path program 1 times [2024-11-12 07:21:13,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:13,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790793232] [2024-11-12 07:21:13,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:13,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:13,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:13,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790793232] [2024-11-12 07:21:13,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790793232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:13,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:13,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:21:13,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093953550] [2024-11-12 07:21:13,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:13,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:21:13,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:13,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:21:13,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:21:13,758 INFO L87 Difference]: Start difference. First operand 320 states and 408 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:13,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:13,821 INFO L93 Difference]: Finished difference Result 499 states and 630 transitions. [2024-11-12 07:21:13,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:21:13,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2024-11-12 07:21:13,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:13,823 INFO L225 Difference]: With dead ends: 499 [2024-11-12 07:21:13,823 INFO L226 Difference]: Without dead ends: 322 [2024-11-12 07:21:13,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 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-11-12 07:21:13,824 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 41 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:13,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 580 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:21:13,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-12 07:21:13,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2024-11-12 07:21:13,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 244 states have (on average 1.110655737704918) internal successors, (271), 246 states have internal predecessors, (271), 68 states have call successors, (68), 7 states have call predecessors, (68), 7 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-12 07:21:13,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 407 transitions. [2024-11-12 07:21:13,873 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 407 transitions. Word has length 157 [2024-11-12 07:21:13,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:13,873 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 407 transitions. [2024-11-12 07:21:13,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:13,874 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 407 transitions. [2024-11-12 07:21:13,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-12 07:21:13,874 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:13,875 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:13,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 07:21:13,875 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:13,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:13,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1917553494, now seen corresponding path program 1 times [2024-11-12 07:21:13,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:13,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809778730] [2024-11-12 07:21:13,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:13,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 07:21:14,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2124151323] [2024-11-12 07:21:14,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:14,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:21:14,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:21:14,048 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 07:21:14,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 07:21:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:14,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-12 07:21:14,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:21:15,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 07:21:15,500 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 23 treesize of output 3 [2024-11-12 07:21:15,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 07:21:16,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:21:16,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 74 [2024-11-12 07:21:17,043 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 4 proven. 512 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-11-12 07:21:17,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:21:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:17,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:17,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809778730] [2024-11-12 07:21:17,506 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 07:21:17,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124151323] [2024-11-12 07:21:17,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124151323] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:21:17,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:21:17,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-11-12 07:21:17,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165408484] [2024-11-12 07:21:17,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:17,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:21:17,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:17,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:21:17,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-12 07:21:17,507 INFO L87 Difference]: Start difference. First operand 320 states and 407 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:18,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:18,073 INFO L93 Difference]: Finished difference Result 776 states and 957 transitions. [2024-11-12 07:21:18,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:21:18,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2024-11-12 07:21:18,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:18,077 INFO L225 Difference]: With dead ends: 776 [2024-11-12 07:21:18,077 INFO L226 Difference]: Without dead ends: 504 [2024-11-12 07:21:18,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-12 07:21:18,078 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 96 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:18,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 307 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:21:18,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-12 07:21:18,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 412. [2024-11-12 07:21:18,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 325 states have (on average 1.0923076923076922) internal successors, (355), 328 states have internal predecessors, (355), 76 states have call successors, (76), 10 states have call predecessors, (76), 10 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-12 07:21:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 507 transitions. [2024-11-12 07:21:18,108 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 507 transitions. Word has length 158 [2024-11-12 07:21:18,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:18,108 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 507 transitions. [2024-11-12 07:21:18,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:18,108 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 507 transitions. [2024-11-12 07:21:18,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-12 07:21:18,109 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:18,110 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:18,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 07:21:18,310 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-11-12 07:21:18,311 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:18,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:18,312 INFO L85 PathProgramCache]: Analyzing trace with hash 822164862, now seen corresponding path program 1 times [2024-11-12 07:21:18,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:18,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314650423] [2024-11-12 07:21:18,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:18,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:32,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:32,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:32,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:32,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:32,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:32,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:32,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:32,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:32,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:32,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:32,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:32,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:32,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:32,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:32,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:32,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:32,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:32,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:32,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:32,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:32,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:32,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314650423] [2024-11-12 07:21:32,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314650423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:32,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:32,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:21:32,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407688404] [2024-11-12 07:21:32,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:32,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 07:21:32,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:32,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 07:21:32,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:21:32,089 INFO L87 Difference]: Start difference. First operand 412 states and 507 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:32,665 INFO L93 Difference]: Finished difference Result 668 states and 815 transitions. [2024-11-12 07:21:32,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 07:21:32,669 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 159 [2024-11-12 07:21:32,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:32,672 INFO L225 Difference]: With dead ends: 668 [2024-11-12 07:21:32,672 INFO L226 Difference]: Without dead ends: 455 [2024-11-12 07:21:32,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-11-12 07:21:32,673 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 228 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:32,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 665 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:21:32,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-12 07:21:32,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 265. [2024-11-12 07:21:32,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 210 states have (on average 1.1) internal successors, (231), 212 states have internal predecessors, (231), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 07:21:32,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 327 transitions. [2024-11-12 07:21:32,699 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 327 transitions. Word has length 159 [2024-11-12 07:21:32,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:32,699 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 327 transitions. [2024-11-12 07:21:32,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:21:32,699 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 327 transitions. [2024-11-12 07:21:32,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-12 07:21:32,700 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:32,701 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:32,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 07:21:32,701 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:32,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:32,701 INFO L85 PathProgramCache]: Analyzing trace with hash 869317995, now seen corresponding path program 1 times [2024-11-12 07:21:32,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:32,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181936553] [2024-11-12 07:21:32,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:32,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:33,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:33,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:33,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:33,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:33,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:33,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:33,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:33,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:33,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:33,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:33,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:33,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:33,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:33,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:33,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:33,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:34,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:34,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:34,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:34,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:34,031 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:34,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:34,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181936553] [2024-11-12 07:21:34,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181936553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:34,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:34,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:21:34,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438435425] [2024-11-12 07:21:34,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:34,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 07:21:34,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:34,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 07:21:34,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:21:34,032 INFO L87 Difference]: Start difference. First operand 265 states and 327 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:21:34,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:34,572 INFO L93 Difference]: Finished difference Result 544 states and 657 transitions. [2024-11-12 07:21:34,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:21:34,573 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 159 [2024-11-12 07:21:34,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:34,574 INFO L225 Difference]: With dead ends: 544 [2024-11-12 07:21:34,574 INFO L226 Difference]: Without dead ends: 331 [2024-11-12 07:21:34,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:21:34,575 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 355 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:34,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 582 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:21:34,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-12 07:21:34,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 295. [2024-11-12 07:21:34,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 240 states have (on average 1.0958333333333334) internal successors, (263), 242 states have internal predecessors, (263), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 07:21:34,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 359 transitions. [2024-11-12 07:21:34,606 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 359 transitions. Word has length 159 [2024-11-12 07:21:34,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:34,606 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 359 transitions. [2024-11-12 07:21:34,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:21:34,607 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 359 transitions. [2024-11-12 07:21:34,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 07:21:34,608 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:34,608 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:34,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 07:21:34,608 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:34,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:34,609 INFO L85 PathProgramCache]: Analyzing trace with hash 826392251, now seen corresponding path program 1 times [2024-11-12 07:21:34,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:34,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297832488] [2024-11-12 07:21:34,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:34,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:36,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:36,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:36,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:36,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:36,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:36,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:36,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:36,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:36,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:36,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:36,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:36,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:36,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:36,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:36,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:36,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:36,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:36,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:36,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:36,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:36,485 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:36,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:36,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297832488] [2024-11-12 07:21:36,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297832488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:36,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:36,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-12 07:21:36,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760967909] [2024-11-12 07:21:36,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:36,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 07:21:36,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:36,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 07:21:36,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-12 07:21:36,487 INFO L87 Difference]: Start difference. First operand 295 states and 359 transitions. Second operand has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 07:21:38,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:38,170 INFO L93 Difference]: Finished difference Result 761 states and 913 transitions. [2024-11-12 07:21:38,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 07:21:38,171 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2024-11-12 07:21:38,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:38,176 INFO L225 Difference]: With dead ends: 761 [2024-11-12 07:21:38,176 INFO L226 Difference]: Without dead ends: 518 [2024-11-12 07:21:38,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=733, Unknown=0, NotChecked=0, Total=870 [2024-11-12 07:21:38,178 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 136 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:38,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1147 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-12 07:21:38,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-11-12 07:21:38,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 472. [2024-11-12 07:21:38,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 385 states have (on average 1.0883116883116883) internal successors, (419), 388 states have internal predecessors, (419), 76 states have call successors, (76), 10 states have call predecessors, (76), 10 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-12 07:21:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 571 transitions. [2024-11-12 07:21:38,262 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 571 transitions. Word has length 160 [2024-11-12 07:21:38,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:38,262 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 571 transitions. [2024-11-12 07:21:38,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 07:21:38,263 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 571 transitions. [2024-11-12 07:21:38,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 07:21:38,264 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:38,264 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:38,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 07:21:38,264 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:38,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:38,266 INFO L85 PathProgramCache]: Analyzing trace with hash 239586237, now seen corresponding path program 1 times [2024-11-12 07:21:38,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:38,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807905419] [2024-11-12 07:21:38,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:38,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:39,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:39,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:39,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:39,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:39,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:39,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:39,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:39,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:39,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:39,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:39,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:39,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:39,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:39,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:39,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:39,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:39,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:39,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:39,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:39,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:39,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:39,287 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:39,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:39,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807905419] [2024-11-12 07:21:39,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807905419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:39,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:39,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 07:21:39,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815977466] [2024-11-12 07:21:39,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:39,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 07:21:39,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:39,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 07:21:39,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:21:39,289 INFO L87 Difference]: Start difference. First operand 472 states and 571 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 07:21:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:40,148 INFO L93 Difference]: Finished difference Result 1111 states and 1332 transitions. [2024-11-12 07:21:40,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:21:40,149 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2024-11-12 07:21:40,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:40,152 INFO L225 Difference]: With dead ends: 1111 [2024-11-12 07:21:40,152 INFO L226 Difference]: Without dead ends: 691 [2024-11-12 07:21:40,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-11-12 07:21:40,154 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 263 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:40,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 881 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:21:40,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-11-12 07:21:40,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 687. [2024-11-12 07:21:40,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 553 states have (on average 1.0723327305605788) internal successors, (593), 559 states have internal predecessors, (593), 116 states have call successors, (116), 17 states have call predecessors, (116), 17 states have return successors, (116), 110 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-12 07:21:40,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 825 transitions. [2024-11-12 07:21:40,327 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 825 transitions. Word has length 160 [2024-11-12 07:21:40,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:40,328 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 825 transitions. [2024-11-12 07:21:40,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 07:21:40,328 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 825 transitions. [2024-11-12 07:21:40,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 07:21:40,329 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:40,329 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:40,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 07:21:40,329 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:40,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:40,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1527992125, now seen corresponding path program 1 times [2024-11-12 07:21:40,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:40,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180058771] [2024-11-12 07:21:40,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:40,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:41,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:41,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:41,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:41,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:41,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:41,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:41,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:41,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:41,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:41,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:41,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:41,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:41,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:41,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:41,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:41,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:41,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:41,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:41,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:41,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:41,272 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:41,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:41,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180058771] [2024-11-12 07:21:41,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180058771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:41,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:41,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 07:21:41,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850194117] [2024-11-12 07:21:41,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:41,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 07:21:41,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:41,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 07:21:41,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:21:41,274 INFO L87 Difference]: Start difference. First operand 687 states and 825 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 07:21:41,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:41,926 INFO L93 Difference]: Finished difference Result 1415 states and 1692 transitions. [2024-11-12 07:21:41,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:21:41,927 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2024-11-12 07:21:41,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:41,930 INFO L225 Difference]: With dead ends: 1415 [2024-11-12 07:21:41,930 INFO L226 Difference]: Without dead ends: 780 [2024-11-12 07:21:41,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-11-12 07:21:41,932 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 270 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:41,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 661 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:21:41,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-11-12 07:21:42,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 664. [2024-11-12 07:21:42,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 529 states have (on average 1.0642722117202268) internal successors, (563), 534 states have internal predecessors, (563), 116 states have call successors, (116), 18 states have call predecessors, (116), 18 states have return successors, (116), 111 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-12 07:21:42,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 795 transitions. [2024-11-12 07:21:42,035 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 795 transitions. Word has length 160 [2024-11-12 07:21:42,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:42,035 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 795 transitions. [2024-11-12 07:21:42,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 07:21:42,035 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 795 transitions. [2024-11-12 07:21:42,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 07:21:42,036 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:42,036 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:42,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-12 07:21:42,037 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:42,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:42,037 INFO L85 PathProgramCache]: Analyzing trace with hash 941186111, now seen corresponding path program 1 times [2024-11-12 07:21:42,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:42,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025101524] [2024-11-12 07:21:42,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:42,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:43,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:43,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:43,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:43,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:43,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:43,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:43,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:43,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:43,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:43,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:43,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:43,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:43,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:43,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:43,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:43,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:43,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:43,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:43,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:43,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:43,414 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:43,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:43,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025101524] [2024-11-12 07:21:43,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025101524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:43,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:43,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-12 07:21:43,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297791886] [2024-11-12 07:21:43,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:43,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 07:21:43,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:43,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 07:21:43,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-11-12 07:21:43,416 INFO L87 Difference]: Start difference. First operand 664 states and 795 transitions. Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 07:21:44,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:44,968 INFO L93 Difference]: Finished difference Result 1274 states and 1519 transitions. [2024-11-12 07:21:44,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 07:21:44,969 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2024-11-12 07:21:44,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:44,972 INFO L225 Difference]: With dead ends: 1274 [2024-11-12 07:21:44,972 INFO L226 Difference]: Without dead ends: 666 [2024-11-12 07:21:44,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2024-11-12 07:21:44,974 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 172 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:44,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1160 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 07:21:44,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-11-12 07:21:45,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 601. [2024-11-12 07:21:45,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 484 states have (on average 1.0661157024793388) internal successors, (516), 488 states have internal predecessors, (516), 100 states have call successors, (100), 16 states have call predecessors, (100), 16 states have return successors, (100), 96 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-12 07:21:45,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 716 transitions. [2024-11-12 07:21:45,071 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 716 transitions. Word has length 160 [2024-11-12 07:21:45,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:45,072 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 716 transitions. [2024-11-12 07:21:45,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 07:21:45,072 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 716 transitions. [2024-11-12 07:21:45,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 07:21:45,073 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:45,073 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:45,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-12 07:21:45,073 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:45,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:45,074 INFO L85 PathProgramCache]: Analyzing trace with hash -34453229, now seen corresponding path program 1 times [2024-11-12 07:21:45,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:45,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711860993] [2024-11-12 07:21:45,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:45,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:45,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:45,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:45,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:45,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:45,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:45,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:45,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:45,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:45,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:45,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:45,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:45,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:45,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:45,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:45,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:45,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:45,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:45,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:45,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:45,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:45,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:45,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711860993] [2024-11-12 07:21:45,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711860993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:45,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:45,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:21:45,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986620411] [2024-11-12 07:21:45,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:45,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:21:45,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:45,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:21:45,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:21:45,263 INFO L87 Difference]: Start difference. First operand 601 states and 716 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:21:45,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:45,583 INFO L93 Difference]: Finished difference Result 1223 states and 1425 transitions. [2024-11-12 07:21:45,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:21:45,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2024-11-12 07:21:45,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:45,587 INFO L225 Difference]: With dead ends: 1223 [2024-11-12 07:21:45,587 INFO L226 Difference]: Without dead ends: 857 [2024-11-12 07:21:45,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:21:45,589 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 190 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:45,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 397 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:21:45,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-11-12 07:21:45,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 653. [2024-11-12 07:21:45,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 536 states have (on average 1.0727611940298507) internal successors, (575), 539 states have internal predecessors, (575), 100 states have call successors, (100), 16 states have call predecessors, (100), 16 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-12 07:21:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 775 transitions. [2024-11-12 07:21:45,694 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 775 transitions. Word has length 160 [2024-11-12 07:21:45,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:45,694 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 775 transitions. [2024-11-12 07:21:45,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:21:45,694 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 775 transitions. [2024-11-12 07:21:45,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 07:21:45,695 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:45,695 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:45,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-12 07:21:45,695 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:45,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:45,696 INFO L85 PathProgramCache]: Analyzing trace with hash -780761969, now seen corresponding path program 1 times [2024-11-12 07:21:45,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:45,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956228429] [2024-11-12 07:21:45,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:45,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:46,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:46,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:46,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:46,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:46,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:46,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:46,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:46,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:46,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:46,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:46,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:46,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:46,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:46,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:46,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:46,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:46,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:46,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:46,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:46,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:46,282 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:46,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:46,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956228429] [2024-11-12 07:21:46,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956228429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:46,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:46,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 07:21:46,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515643804] [2024-11-12 07:21:46,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:46,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:21:46,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:46,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:21:46,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:21:46,285 INFO L87 Difference]: Start difference. First operand 653 states and 775 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:21:46,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:46,872 INFO L93 Difference]: Finished difference Result 1052 states and 1241 transitions. [2024-11-12 07:21:46,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 07:21:46,872 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2024-11-12 07:21:46,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:46,875 INFO L225 Difference]: With dead ends: 1052 [2024-11-12 07:21:46,875 INFO L226 Difference]: Without dead ends: 686 [2024-11-12 07:21:46,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2024-11-12 07:21:46,877 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 201 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:46,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1025 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:21:46,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-11-12 07:21:46,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 630. [2024-11-12 07:21:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 513 states have (on average 1.0682261208576997) internal successors, (548), 516 states have internal predecessors, (548), 100 states have call successors, (100), 16 states have call predecessors, (100), 16 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-12 07:21:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 748 transitions. [2024-11-12 07:21:46,984 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 748 transitions. Word has length 160 [2024-11-12 07:21:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:46,985 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 748 transitions. [2024-11-12 07:21:46,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:21:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 748 transitions. [2024-11-12 07:21:46,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-12 07:21:46,985 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:46,986 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:46,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-12 07:21:46,986 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:46,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:46,986 INFO L85 PathProgramCache]: Analyzing trace with hash 807872812, now seen corresponding path program 1 times [2024-11-12 07:21:46,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:46,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892060425] [2024-11-12 07:21:46,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:46,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:48,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:48,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:48,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:48,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:48,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:48,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:48,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:48,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:48,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:48,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:48,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:48,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:48,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:48,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:48,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:48,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:48,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:48,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:48,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:48,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:48,124 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:48,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:48,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892060425] [2024-11-12 07:21:48,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892060425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:48,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:48,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 07:21:48,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490976473] [2024-11-12 07:21:48,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:48,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 07:21:48,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:48,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 07:21:48,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-12 07:21:48,125 INFO L87 Difference]: Start difference. First operand 630 states and 748 transitions. Second operand has 15 states, 14 states have (on average 4.714285714285714) internal successors, (66), 15 states have internal predecessors, (66), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:21:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:49,263 INFO L93 Difference]: Finished difference Result 1095 states and 1292 transitions. [2024-11-12 07:21:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 07:21:49,264 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.714285714285714) internal successors, (66), 15 states have internal predecessors, (66), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 163 [2024-11-12 07:21:49,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:49,267 INFO L225 Difference]: With dead ends: 1095 [2024-11-12 07:21:49,267 INFO L226 Difference]: Without dead ends: 752 [2024-11-12 07:21:49,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2024-11-12 07:21:49,269 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 121 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:49,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1119 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:21:49,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-11-12 07:21:49,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 626. [2024-11-12 07:21:49,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 509 states have (on average 1.0667976424361494) internal successors, (543), 512 states have internal predecessors, (543), 100 states have call successors, (100), 16 states have call predecessors, (100), 16 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-12 07:21:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 743 transitions. [2024-11-12 07:21:49,376 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 743 transitions. Word has length 163 [2024-11-12 07:21:49,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:49,376 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 743 transitions. [2024-11-12 07:21:49,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.714285714285714) internal successors, (66), 15 states have internal predecessors, (66), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:21:49,377 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 743 transitions. [2024-11-12 07:21:49,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-12 07:21:49,377 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:21:49,378 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:49,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-12 07:21:49,378 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:21:49,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:21:49,378 INFO L85 PathProgramCache]: Analyzing trace with hash 148680240, now seen corresponding path program 1 times [2024-11-12 07:21:49,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:21:49,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636103888] [2024-11-12 07:21:49,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:21:49,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:21:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:50,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:21:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:50,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:21:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:50,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:21:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:50,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:21:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:50,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:21:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:50,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:21:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:50,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:21:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:50,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:21:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:50,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:21:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:50,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:21:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:50,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:21:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:50,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:21:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:50,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:21:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:50,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:21:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:50,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:21:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:50,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:21:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:50,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:21:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:50,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:21:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:50,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:21:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:50,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 07:21:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:21:50,937 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:21:50,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:21:50,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636103888] [2024-11-12 07:21:50,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636103888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:21:50,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:21:50,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 07:21:50,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793616380] [2024-11-12 07:21:50,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:21:50,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 07:21:50,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:21:50,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 07:21:50,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-12 07:21:50,939 INFO L87 Difference]: Start difference. First operand 626 states and 743 transitions. Second operand has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:21:52,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:21:52,191 INFO L93 Difference]: Finished difference Result 1034 states and 1219 transitions. [2024-11-12 07:21:52,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 07:21:52,192 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 163 [2024-11-12 07:21:52,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:21:52,193 INFO L225 Difference]: With dead ends: 1034 [2024-11-12 07:21:52,193 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 07:21:52,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2024-11-12 07:21:52,196 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 173 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:21:52,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 988 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 07:21:52,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 07:21:52,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 07:21:52,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 07:21:52,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 07:21:52,198 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 163 [2024-11-12 07:21:52,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:21:52,198 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 07:21:52,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:21:52,198 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 07:21:52,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 07:21:52,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:21:52,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-12 07:21:52,205 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:21:52,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.