./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-19.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 47ed50ee23bce943b6d8d1ef42e1233b8fd974d0271bfb8e1001a06043bdfcc4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:24:07,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:24:07,580 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:24:07,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:24:07,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:24:07,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:24:07,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:24:07,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:24:07,609 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:24:07,610 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:24:07,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:24:07,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:24:07,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:24:07,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:24:07,614 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:24:07,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:24:07,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:24:07,615 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:24:07,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:24:07,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:24:07,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:24:07,616 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:24:07,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:24:07,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:24:07,616 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:24:07,616 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:24:07,616 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:24:07,617 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:24:07,617 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:24:07,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:24:07,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:24:07,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:24:07,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:24:07,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:24:07,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:24:07,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:24:07,618 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:24:07,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:24:07,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:24:07,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:24:07,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:24:07,620 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:24:07,620 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 -> 47ed50ee23bce943b6d8d1ef42e1233b8fd974d0271bfb8e1001a06043bdfcc4 [2024-10-24 11:24:07,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:24:07,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:24:07,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:24:07,864 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:24:07,865 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:24:07,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-19.i [2024-10-24 11:24:09,021 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:24:09,194 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:24:09,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-19.i [2024-10-24 11:24:09,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54227cc59/02946ae24e014d6ca691f1e43ff97b0e/FLAG703998b79 [2024-10-24 11:24:09,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54227cc59/02946ae24e014d6ca691f1e43ff97b0e [2024-10-24 11:24:09,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:24:09,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:24:09,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:24:09,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:24:09,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:24:09,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:24:09" (1/1) ... [2024-10-24 11:24:09,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72a29129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:09, skipping insertion in model container [2024-10-24 11:24:09,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:24:09" (1/1) ... [2024-10-24 11:24:09,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:24:09,779 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-19.i[917,930] [2024-10-24 11:24:09,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:24:09,832 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:24:09,841 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-19.i[917,930] [2024-10-24 11:24:09,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:24:09,885 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:24:09,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:09 WrapperNode [2024-10-24 11:24:09,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:24:09,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:24:09,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:24:09,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:24:09,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:09" (1/1) ... [2024-10-24 11:24:09,908 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:09" (1/1) ... [2024-10-24 11:24:09,938 INFO L138 Inliner]: procedures = 26, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 480 [2024-10-24 11:24:09,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:24:09,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:24:09,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:24:09,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:24:09,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:09" (1/1) ... [2024-10-24 11:24:09,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:09" (1/1) ... [2024-10-24 11:24:09,952 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:09" (1/1) ... [2024-10-24 11:24:09,971 INFO L175 MemorySlicer]: Split 124 memory accesses to 6 slices as follows [2, 8, 43, 27, 26, 18]. 35 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 3, 4, 2, 2]. The 15 writes are split as follows [0, 1, 4, 6, 2, 2]. [2024-10-24 11:24:09,971 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:09" (1/1) ... [2024-10-24 11:24:09,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:09" (1/1) ... [2024-10-24 11:24:09,988 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:09" (1/1) ... [2024-10-24 11:24:09,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:09" (1/1) ... [2024-10-24 11:24:10,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:09" (1/1) ... [2024-10-24 11:24:10,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:09" (1/1) ... [2024-10-24 11:24:10,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:24:10,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:24:10,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:24:10,014 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:24:10,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:09" (1/1) ... [2024-10-24 11:24:10,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:24:10,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:24:10,043 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:24:10,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:24:10,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:24:10,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:24:10,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:24:10,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:24:10,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:24:10,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:24:10,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 11:24:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:24:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:24:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:24:10,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:24:10,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:24:10,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 11:24:10,089 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:24:10,089 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:24:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:24:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:24:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:24:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:24:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:24:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 11:24:10,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:24:10,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:24:10,213 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:24:10,215 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:24:10,623 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-10-24 11:24:10,623 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:24:10,658 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:24:10,658 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:24:10,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:24:10 BoogieIcfgContainer [2024-10-24 11:24:10,659 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:24:10,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:24:10,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:24:10,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:24:10,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:24:09" (1/3) ... [2024-10-24 11:24:10,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17090ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:24:10, skipping insertion in model container [2024-10-24 11:24:10,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:24:09" (2/3) ... [2024-10-24 11:24:10,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17090ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:24:10, skipping insertion in model container [2024-10-24 11:24:10,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:24:10" (3/3) ... [2024-10-24 11:24:10,669 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-19.i [2024-10-24 11:24:10,681 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:24:10,681 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:24:10,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:24:10,732 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;@1f31a040, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:24:10,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:24:10,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 76 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:24:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 11:24:10,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:10,749 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:10,749 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:10,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:10,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1166706608, now seen corresponding path program 1 times [2024-10-24 11:24:10,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:10,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065622615] [2024-10-24 11:24:10,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:10,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:24:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:24:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:24:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:24:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:24:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:24:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,104 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:24:11,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:11,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065622615] [2024-10-24 11:24:11,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065622615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:11,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:11,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:24:11,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503399914] [2024-10-24 11:24:11,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:11,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:24:11,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:11,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:24:11,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:24:11,140 INFO L87 Difference]: Start difference. First operand has 95 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 76 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:24:11,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:11,178 INFO L93 Difference]: Finished difference Result 187 states and 297 transitions. [2024-10-24 11:24:11,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:24:11,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 127 [2024-10-24 11:24:11,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:11,187 INFO L225 Difference]: With dead ends: 187 [2024-10-24 11:24:11,188 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 11:24:11,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:24:11,195 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:11,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:24:11,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 11:24:11,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-24 11:24:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 74 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:24:11,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 134 transitions. [2024-10-24 11:24:11,232 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 134 transitions. Word has length 127 [2024-10-24 11:24:11,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:11,234 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 134 transitions. [2024-10-24 11:24:11,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:24:11,234 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 134 transitions. [2024-10-24 11:24:11,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 11:24:11,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:11,236 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:11,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:24:11,237 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:11,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:11,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1763592878, now seen corresponding path program 1 times [2024-10-24 11:24:11,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:11,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920718685] [2024-10-24 11:24:11,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:11,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:24:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:24:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:24:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:24:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:24:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:24:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:24:11,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:11,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920718685] [2024-10-24 11:24:11,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920718685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:11,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:11,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:24:11,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486506999] [2024-10-24 11:24:11,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:11,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:24:11,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:11,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:24:11,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:24:11,592 INFO L87 Difference]: Start difference. First operand 93 states and 134 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:24:11,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:11,634 INFO L93 Difference]: Finished difference Result 188 states and 271 transitions. [2024-10-24 11:24:11,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:24:11,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 127 [2024-10-24 11:24:11,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:11,637 INFO L225 Difference]: With dead ends: 188 [2024-10-24 11:24:11,638 INFO L226 Difference]: Without dead ends: 96 [2024-10-24 11:24:11,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:24:11,640 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:11,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 377 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:24:11,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-24 11:24:11,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-10-24 11:24:11,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 76 states have internal predecessors, (102), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:24:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 136 transitions. [2024-10-24 11:24:11,655 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 136 transitions. Word has length 127 [2024-10-24 11:24:11,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:11,658 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 136 transitions. [2024-10-24 11:24:11,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:24:11,658 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 136 transitions. [2024-10-24 11:24:11,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 11:24:11,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:11,660 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:11,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:24:11,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:11,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:11,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1763533296, now seen corresponding path program 1 times [2024-10-24 11:24:11,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:11,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639393090] [2024-10-24 11:24:11,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:11,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:12,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:12,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:12,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:24:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:12,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:24:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:12,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:12,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:12,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:12,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:12,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:12,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:12,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:12,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:12,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:12,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:24:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:12,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:24:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:12,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:24:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:12,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:24:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:12,612 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:24:12,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:12,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639393090] [2024-10-24 11:24:12,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639393090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:12,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:12,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:24:12,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859258680] [2024-10-24 11:24:12,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:12,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:24:12,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:12,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:24:12,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:24:12,615 INFO L87 Difference]: Start difference. First operand 95 states and 136 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:24:12,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:12,881 INFO L93 Difference]: Finished difference Result 240 states and 339 transitions. [2024-10-24 11:24:12,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:24:12,881 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 127 [2024-10-24 11:24:12,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:12,883 INFO L225 Difference]: With dead ends: 240 [2024-10-24 11:24:12,883 INFO L226 Difference]: Without dead ends: 146 [2024-10-24 11:24:12,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:24:12,884 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 56 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:12,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 730 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:24:12,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-24 11:24:12,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2024-10-24 11:24:12,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 121 states have (on average 1.3388429752066116) internal successors, (162), 122 states have internal predecessors, (162), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:24:12,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 200 transitions. [2024-10-24 11:24:12,901 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 200 transitions. Word has length 127 [2024-10-24 11:24:12,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:12,901 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 200 transitions. [2024-10-24 11:24:12,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:24:12,903 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 200 transitions. [2024-10-24 11:24:12,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 11:24:12,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:12,908 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:12,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:24:12,908 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:12,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:12,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1510365646, now seen corresponding path program 1 times [2024-10-24 11:24:12,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:12,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934075463] [2024-10-24 11:24:12,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:12,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:24:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:24:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:24:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:24:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:24:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:24:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:24:13,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:13,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934075463] [2024-10-24 11:24:13,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934075463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:13,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:13,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:24:13,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407338608] [2024-10-24 11:24:13,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:13,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:24:13,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:13,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:24:13,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:24:13,157 INFO L87 Difference]: Start difference. First operand 143 states and 200 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:24:13,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:13,219 INFO L93 Difference]: Finished difference Result 325 states and 453 transitions. [2024-10-24 11:24:13,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:24:13,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 127 [2024-10-24 11:24:13,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:13,223 INFO L225 Difference]: With dead ends: 325 [2024-10-24 11:24:13,223 INFO L226 Difference]: Without dead ends: 183 [2024-10-24 11:24:13,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:24:13,230 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 45 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:13,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 627 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:24:13,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-24 11:24:13,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 149. [2024-10-24 11:24:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 128 states have internal predecessors, (170), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:24:13,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 208 transitions. [2024-10-24 11:24:13,241 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 208 transitions. Word has length 127 [2024-10-24 11:24:13,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:13,241 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 208 transitions. [2024-10-24 11:24:13,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:24:13,242 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 208 transitions. [2024-10-24 11:24:13,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 11:24:13,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:13,243 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:13,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:24:13,243 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:13,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:13,244 INFO L85 PathProgramCache]: Analyzing trace with hash 510667031, now seen corresponding path program 1 times [2024-10-24 11:24:13,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:13,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108631188] [2024-10-24 11:24:13,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:13,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:24:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:24:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:24:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:24:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:24:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:24:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:13,673 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:24:13,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:13,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108631188] [2024-10-24 11:24:13,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108631188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:13,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:13,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:24:13,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769208264] [2024-10-24 11:24:13,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:13,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:24:13,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:13,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:24:13,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:24:13,677 INFO L87 Difference]: Start difference. First operand 149 states and 208 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:24:13,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:13,962 INFO L93 Difference]: Finished difference Result 386 states and 532 transitions. [2024-10-24 11:24:13,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:24:13,965 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 128 [2024-10-24 11:24:13,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:13,967 INFO L225 Difference]: With dead ends: 386 [2024-10-24 11:24:13,967 INFO L226 Difference]: Without dead ends: 238 [2024-10-24 11:24:13,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:24:13,968 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 64 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:13,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 740 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:24:13,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-24 11:24:13,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 235. [2024-10-24 11:24:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 203 states have (on average 1.3152709359605912) internal successors, (267), 206 states have internal predecessors, (267), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:24:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 321 transitions. [2024-10-24 11:24:13,991 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 321 transitions. Word has length 128 [2024-10-24 11:24:13,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:13,993 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 321 transitions. [2024-10-24 11:24:13,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:24:13,993 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 321 transitions. [2024-10-24 11:24:13,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:24:13,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:13,995 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:13,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:24:13,995 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:13,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:13,996 INFO L85 PathProgramCache]: Analyzing trace with hash -653720733, now seen corresponding path program 1 times [2024-10-24 11:24:13,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:13,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805627466] [2024-10-24 11:24:13,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:13,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:14,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:14,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:14,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:24:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:14,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:24:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:14,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:14,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:14,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:14,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:14,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:14,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:14,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:14,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:14,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:14,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:24:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:14,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:24:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:14,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:24:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:14,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:24:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:24:14,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:14,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805627466] [2024-10-24 11:24:14,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805627466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:14,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:14,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:24:14,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937425436] [2024-10-24 11:24:14,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:14,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:24:14,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:14,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:24:14,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:24:14,376 INFO L87 Difference]: Start difference. First operand 235 states and 321 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:24:14,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:14,763 INFO L93 Difference]: Finished difference Result 671 states and 910 transitions. [2024-10-24 11:24:14,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:24:14,763 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 129 [2024-10-24 11:24:14,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:14,765 INFO L225 Difference]: With dead ends: 671 [2024-10-24 11:24:14,765 INFO L226 Difference]: Without dead ends: 433 [2024-10-24 11:24:14,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:24:14,766 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 87 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:14,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1022 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:24:14,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-10-24 11:24:14,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 274. [2024-10-24 11:24:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 242 states have (on average 1.334710743801653) internal successors, (323), 245 states have internal predecessors, (323), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:24:14,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 377 transitions. [2024-10-24 11:24:14,784 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 377 transitions. Word has length 129 [2024-10-24 11:24:14,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:14,785 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 377 transitions. [2024-10-24 11:24:14,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:24:14,785 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 377 transitions. [2024-10-24 11:24:14,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:24:14,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:14,786 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:14,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:24:14,787 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:14,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:14,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1131589696, now seen corresponding path program 1 times [2024-10-24 11:24:14,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:14,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945215161] [2024-10-24 11:24:14,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:14,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:15,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:15,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:15,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:24:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:15,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:24:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:15,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:15,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:15,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:15,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:15,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:15,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:15,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:15,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:15,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:15,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:24:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:15,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:24:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:15,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:24:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:15,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:24:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-24 11:24:15,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:15,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945215161] [2024-10-24 11:24:15,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945215161] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:24:15,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702350900] [2024-10-24 11:24:15,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:15,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:24:15,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:24:15,387 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:24:15,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:24:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:15,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 11:24:15,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:24:15,727 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-10-24 11:24:15,908 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 27 treesize of output 11 [2024-10-24 11:24:16,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 [2024-10-24 11:24:16,346 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 55 treesize of output 41 [2024-10-24 11:24:16,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:24:16,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 61 [2024-10-24 11:24:16,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:24:16,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2024-10-24 11:24:16,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:24:16,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 63 [2024-10-24 11:24:16,664 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 211 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-10-24 11:24:16,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:24:16,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2024-10-24 11:24:16,732 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base))) (and (forall ((v_ArrVal_194 (Array Int Int))) (let ((.cse1 (select v_ArrVal_194 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))) (or (not (= v_ArrVal_194 (store .cse0 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse1))) (< (+ .cse1 128) 0) (< 0 (+ .cse1 1)) (< 0 (+ (select (select (store |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base v_ArrVal_194) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) 1))))) (forall ((v_ArrVal_194 (Array Int Int))) (let ((.cse2 (select v_ArrVal_194 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset))) (or (< 127 .cse2) (not (= v_ArrVal_194 (store .cse0 c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.offset .cse2))) (< .cse2 0) (< 0 (+ (select (select (store |c_#memory_int#2| c_~signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer~0.base v_ArrVal_194) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.base) c_~signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer~0.offset) 1))))))) is different from false [2024-10-24 11:24:16,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702350900] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:24:16,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:24:16,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2024-10-24 11:24:16,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564200075] [2024-10-24 11:24:16,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:24:16,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 11:24:16,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:16,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 11:24:16,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=255, Unknown=1, NotChecked=32, Total=342 [2024-10-24 11:24:16,947 INFO L87 Difference]: Start difference. First operand 274 states and 377 transitions. Second operand has 18 states, 16 states have (on average 5.875) internal successors, (94), 18 states have internal predecessors, (94), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 9 states have call successors, (34) [2024-10-24 11:24:21,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:24:24,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:24:28,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:24:32,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-10-24 11:24:36,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:24:40,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-10-24 11:24:43,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:24:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:43,632 INFO L93 Difference]: Finished difference Result 610 states and 826 transitions. [2024-10-24 11:24:43,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 11:24:43,633 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.875) internal successors, (94), 18 states have internal predecessors, (94), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 9 states have call successors, (34) Word has length 129 [2024-10-24 11:24:43,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:43,634 INFO L225 Difference]: With dead ends: 610 [2024-10-24 11:24:43,635 INFO L226 Difference]: Without dead ends: 337 [2024-10-24 11:24:43,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=258, Invalid=801, Unknown=1, NotChecked=62, Total=1122 [2024-10-24 11:24:43,636 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 491 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 132 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:43,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 433 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 494 Invalid, 7 Unknown, 0 Unchecked, 26.2s Time] [2024-10-24 11:24:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-24 11:24:43,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 282. [2024-10-24 11:24:43,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 248 states have (on average 1.310483870967742) internal successors, (325), 251 states have internal predecessors, (325), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:24:43,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 379 transitions. [2024-10-24 11:24:43,652 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 379 transitions. Word has length 129 [2024-10-24 11:24:43,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:43,652 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 379 transitions. [2024-10-24 11:24:43,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.875) internal successors, (94), 18 states have internal predecessors, (94), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 9 states have call successors, (34) [2024-10-24 11:24:43,652 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 379 transitions. [2024-10-24 11:24:43,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:24:43,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:43,653 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:43,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 11:24:43,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:24:43,854 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:43,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:43,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1389755134, now seen corresponding path program 1 times [2024-10-24 11:24:43,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:43,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862073195] [2024-10-24 11:24:43,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:43,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:44,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:44,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:44,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:24:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:44,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:24:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:44,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:44,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:44,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:44,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:44,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:44,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:44,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:44,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:44,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:44,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:24:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:44,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:24:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:44,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:24:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:44,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:24:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:24:44,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:44,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862073195] [2024-10-24 11:24:44,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862073195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:44,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:44,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:24:44,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646639986] [2024-10-24 11:24:44,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:44,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:24:44,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:44,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:24:44,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:24:44,487 INFO L87 Difference]: Start difference. First operand 282 states and 379 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:24:44,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:44,860 INFO L93 Difference]: Finished difference Result 671 states and 897 transitions. [2024-10-24 11:24:44,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:24:44,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 129 [2024-10-24 11:24:44,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:44,863 INFO L225 Difference]: With dead ends: 671 [2024-10-24 11:24:44,864 INFO L226 Difference]: Without dead ends: 390 [2024-10-24 11:24:44,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:24:44,866 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 190 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:44,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 663 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:24:44,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-24 11:24:44,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 387. [2024-10-24 11:24:44,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 338 states have (on average 1.2899408284023668) internal successors, (436), 343 states have internal predecessors, (436), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 11:24:44,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 512 transitions. [2024-10-24 11:24:44,899 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 512 transitions. Word has length 129 [2024-10-24 11:24:44,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:44,900 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 512 transitions. [2024-10-24 11:24:44,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:24:44,900 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 512 transitions. [2024-10-24 11:24:44,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 11:24:44,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:44,901 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:44,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:24:44,902 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:44,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:44,902 INFO L85 PathProgramCache]: Analyzing trace with hash 813283554, now seen corresponding path program 1 times [2024-10-24 11:24:44,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:44,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274980305] [2024-10-24 11:24:44,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:44,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:45,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:45,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:45,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:24:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:45,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:24:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:45,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:45,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:45,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:45,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:45,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:45,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:45,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:45,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:45,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:45,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:24:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:45,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:24:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:45,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:24:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:45,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:24:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:24:45,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:45,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274980305] [2024-10-24 11:24:45,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274980305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:45,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:45,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:24:45,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675379767] [2024-10-24 11:24:45,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:45,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:24:45,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:45,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:24:45,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:24:45,442 INFO L87 Difference]: Start difference. First operand 387 states and 512 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:24:45,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:45,848 INFO L93 Difference]: Finished difference Result 879 states and 1159 transitions. [2024-10-24 11:24:45,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:24:45,849 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2024-10-24 11:24:45,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:45,851 INFO L225 Difference]: With dead ends: 879 [2024-10-24 11:24:45,852 INFO L226 Difference]: Without dead ends: 493 [2024-10-24 11:24:45,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:24:45,854 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 62 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:45,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 991 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:24:45,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-10-24 11:24:45,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 407. [2024-10-24 11:24:45,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 358 states have (on average 1.2877094972067038) internal successors, (461), 363 states have internal predecessors, (461), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 11:24:45,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 537 transitions. [2024-10-24 11:24:45,881 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 537 transitions. Word has length 130 [2024-10-24 11:24:45,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:45,882 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 537 transitions. [2024-10-24 11:24:45,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:24:45,882 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 537 transitions. [2024-10-24 11:24:45,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 11:24:45,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:45,883 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:45,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:24:45,884 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:45,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:45,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1130887143, now seen corresponding path program 1 times [2024-10-24 11:24:45,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:45,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169886643] [2024-10-24 11:24:45,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:45,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:46,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:24:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:46,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:24:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:46,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:24:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:46,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:24:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:46,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:24:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:46,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:24:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:46,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:24:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:46,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:24:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:46,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:24:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:46,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:24:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:46,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:24:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:46,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:24:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:46,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:24:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:46,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:24:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:46,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:24:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:46,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:24:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:46,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:24:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:46,346 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:24:46,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:24:46,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169886643] [2024-10-24 11:24:46,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169886643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:24:46,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:24:46,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:24:46,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643065793] [2024-10-24 11:24:46,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:24:46,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:24:46,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:24:46,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:24:46,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:24:46,348 INFO L87 Difference]: Start difference. First operand 407 states and 537 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:24:46,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:24:46,631 INFO L93 Difference]: Finished difference Result 810 states and 1065 transitions. [2024-10-24 11:24:46,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:24:46,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2024-10-24 11:24:46,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:24:46,638 INFO L225 Difference]: With dead ends: 810 [2024-10-24 11:24:46,638 INFO L226 Difference]: Without dead ends: 399 [2024-10-24 11:24:46,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:24:46,639 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 221 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:24:46,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 517 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:24:46,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-10-24 11:24:46,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2024-10-24 11:24:46,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 346 states have (on average 1.2716763005780347) internal successors, (440), 351 states have internal predecessors, (440), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 33 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 11:24:46,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 516 transitions. [2024-10-24 11:24:46,677 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 516 transitions. Word has length 130 [2024-10-24 11:24:46,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:24:46,678 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 516 transitions. [2024-10-24 11:24:46,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:24:46,678 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 516 transitions. [2024-10-24 11:24:46,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 11:24:46,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:24:46,679 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:24:46,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:24:46,680 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:24:46,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:24:46,680 INFO L85 PathProgramCache]: Analyzing trace with hash -403223472, now seen corresponding path program 1 times [2024-10-24 11:24:46,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:24:46,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034971731] [2024-10-24 11:24:46,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:46,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:24:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:24:46,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2073150185] [2024-10-24 11:24:46,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:24:46,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:24:46,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:24:46,757 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:24:46,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 11:24:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:24:47,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 160 conjuncts are in the unsatisfiable core [2024-10-24 11:24:47,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:24:47,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-24 11:24:49,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-24 11:24:50,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-24 11:24:52,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:24:52,161 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 34 treesize of output 16 [2024-10-24 11:24:53,863 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-10-24 11:24:55,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2024-10-24 11:24:57,133 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-10-24 11:24:58,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:24:58,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:24:58,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2024-10-24 11:24:58,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:24:58,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 11:24:58,961 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2024-10-24 11:24:58,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 74 [2024-10-24 11:25:01,290 INFO L349 Elim1Store]: treesize reduction 156, result has 63.0 percent of original size [2024-10-24 11:25:01,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 201 treesize of output 390