./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/process_queue.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/process_queue.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.graphml --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 1ad9f94c1d10f7bc5f4235ca7c5dc51413b43a0e6c48b9e48da5d2e3e751252c --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 10:47:12,808 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 10:47:12,810 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 10:47:12,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 10:47:12,860 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 10:47:12,863 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 10:47:12,865 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 10:47:12,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 10:47:12,869 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 10:47:12,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 10:47:12,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 10:47:12,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 10:47:12,876 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 10:47:12,878 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 10:47:12,879 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 10:47:12,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 10:47:12,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 10:47:12,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 10:47:12,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 10:47:12,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 10:47:12,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 10:47:12,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 10:47:12,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 10:47:12,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 10:47:12,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 10:47:12,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 10:47:12,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 10:47:12,906 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 10:47:12,907 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 10:47:12,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 10:47:12,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 10:47:12,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 10:47:12,910 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 10:47:12,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 10:47:12,912 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 10:47:12,912 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 10:47:12,913 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 10:47:12,913 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 10:47:12,913 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 10:47:12,914 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 10:47:12,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 10:47:12,917 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 10:47:12,946 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 10:47:12,946 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 10:47:12,947 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 10:47:12,947 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 10:47:12,948 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 10:47:12,948 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 10:47:12,949 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 10:47:12,949 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 10:47:12,949 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 10:47:12,949 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 10:47:12,950 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 10:47:12,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 10:47:12,951 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 10:47:12,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 10:47:12,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 10:47:12,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 10:47:12,952 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 10:47:12,952 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 10:47:12,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 10:47:12,952 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 10:47:12,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 10:47:12,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 10:47:12,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 10:47:12,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 10:47:12,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 10:47:12,954 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 10:47:12,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 10:47:12,955 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 10:47:12,955 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 10:47:12,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 10:47:12,956 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 10:47:12,956 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 10:47:12,956 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 10:47:12,956 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 10:47:12,956 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> 1ad9f94c1d10f7bc5f4235ca7c5dc51413b43a0e6c48b9e48da5d2e3e751252c [2021-12-15 10:47:13,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 10:47:13,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 10:47:13,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 10:47:13,205 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 10:47:13,206 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 10:47:13,207 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/process_queue.i [2021-12-15 10:47:13,291 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8839c334/dd67972eda014fc9bf785e41556ff8bf/FLAG89df8d80c [2021-12-15 10:47:13,725 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 10:47:13,725 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/process_queue.i [2021-12-15 10:47:13,745 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8839c334/dd67972eda014fc9bf785e41556ff8bf/FLAG89df8d80c [2021-12-15 10:47:14,103 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8839c334/dd67972eda014fc9bf785e41556ff8bf [2021-12-15 10:47:14,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 10:47:14,106 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 10:47:14,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 10:47:14,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 10:47:14,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 10:47:14,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:47:14" (1/1) ... [2021-12-15 10:47:14,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a88a265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:14, skipping insertion in model container [2021-12-15 10:47:14,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:47:14" (1/1) ... [2021-12-15 10:47:14,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 10:47:14,163 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 10:47:14,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/process_queue.i[23979,23992] [2021-12-15 10:47:14,387 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 10:47:14,394 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 10:47:14,448 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/process_queue.i[23979,23992] [2021-12-15 10:47:14,452 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 10:47:14,476 INFO L208 MainTranslator]: Completed translation [2021-12-15 10:47:14,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:14 WrapperNode [2021-12-15 10:47:14,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 10:47:14,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 10:47:14,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 10:47:14,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 10:47:14,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:14" (1/1) ... [2021-12-15 10:47:14,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:14" (1/1) ... [2021-12-15 10:47:14,539 INFO L137 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 111 [2021-12-15 10:47:14,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 10:47:14,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 10:47:14,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 10:47:14,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 10:47:14,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:14" (1/1) ... [2021-12-15 10:47:14,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:14" (1/1) ... [2021-12-15 10:47:14,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:14" (1/1) ... [2021-12-15 10:47:14,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:14" (1/1) ... [2021-12-15 10:47:14,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:14" (1/1) ... [2021-12-15 10:47:14,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:14" (1/1) ... [2021-12-15 10:47:14,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:14" (1/1) ... [2021-12-15 10:47:14,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 10:47:14,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 10:47:14,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 10:47:14,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 10:47:14,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:14" (1/1) ... [2021-12-15 10:47:14,585 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 10:47:14,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:47:14,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-15 10:47:14,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-15 10:47:14,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 10:47:14,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 10:47:14,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 10:47:14,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 10:47:14,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 10:47:14,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 10:47:14,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 10:47:14,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 10:47:14,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-15 10:47:14,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 10:47:14,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 10:47:14,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 10:47:14,714 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 10:47:14,715 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 10:47:14,968 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 10:47:14,973 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 10:47:14,973 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-15 10:47:14,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:47:14 BoogieIcfgContainer [2021-12-15 10:47:14,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 10:47:14,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 10:47:14,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 10:47:14,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 10:47:14,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 10:47:14" (1/3) ... [2021-12-15 10:47:14,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a03f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:47:14, skipping insertion in model container [2021-12-15 10:47:14,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:47:14" (2/3) ... [2021-12-15 10:47:14,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a03f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:47:14, skipping insertion in model container [2021-12-15 10:47:14,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:47:14" (3/3) ... [2021-12-15 10:47:14,983 INFO L111 eAbstractionObserver]: Analyzing ICFG process_queue.i [2021-12-15 10:47:14,986 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 10:47:14,986 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 10:47:15,023 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 10:47:15,027 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 10:47:15,028 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 10:47:15,038 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:15,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 10:47:15,043 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:15,043 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:47:15,044 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:15,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:15,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2060272908, now seen corresponding path program 1 times [2021-12-15 10:47:15,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:15,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170117600] [2021-12-15 10:47:15,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:15,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:47:15,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:15,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170117600] [2021-12-15 10:47:15,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170117600] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:47:15,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:47:15,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 10:47:15,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694273515] [2021-12-15 10:47:15,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:47:15,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 10:47:15,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:15,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 10:47:15,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 10:47:15,329 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:15,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:15,367 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2021-12-15 10:47:15,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 10:47:15,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-15 10:47:15,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:15,378 INFO L225 Difference]: With dead ends: 51 [2021-12-15 10:47:15,378 INFO L226 Difference]: Without dead ends: 23 [2021-12-15 10:47:15,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 10:47:15,385 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:47:15,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:47:15,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-15 10:47:15,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-15 10:47:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:15,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2021-12-15 10:47:15,419 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 11 [2021-12-15 10:47:15,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:15,420 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2021-12-15 10:47:15,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:15,422 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2021-12-15 10:47:15,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 10:47:15,423 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:15,423 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:47:15,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 10:47:15,425 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:15,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1911586027, now seen corresponding path program 1 times [2021-12-15 10:47:15,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:15,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602670905] [2021-12-15 10:47:15,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:15,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:15,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:47:15,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:15,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602670905] [2021-12-15 10:47:15,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602670905] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:47:15,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:47:15,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:47:15,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630023993] [2021-12-15 10:47:15,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:47:15,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:47:15,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:15,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:47:15,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:47:15,509 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:15,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:15,571 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2021-12-15 10:47:15,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:47:15,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-15 10:47:15,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:15,573 INFO L225 Difference]: With dead ends: 56 [2021-12-15 10:47:15,573 INFO L226 Difference]: Without dead ends: 35 [2021-12-15 10:47:15,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:47:15,579 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:47:15,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 86 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:47:15,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-15 10:47:15,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2021-12-15 10:47:15,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:15,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2021-12-15 10:47:15,593 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 11 [2021-12-15 10:47:15,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:15,593 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2021-12-15 10:47:15,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:15,594 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2021-12-15 10:47:15,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 10:47:15,594 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:15,595 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:47:15,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 10:47:15,599 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:15,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:15,600 INFO L85 PathProgramCache]: Analyzing trace with hash 459687026, now seen corresponding path program 1 times [2021-12-15 10:47:15,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:15,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264575251] [2021-12-15 10:47:15,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:15,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:47:15,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:15,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264575251] [2021-12-15 10:47:15,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264575251] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:47:15,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:47:15,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 10:47:15,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702519236] [2021-12-15 10:47:15,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:47:15,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 10:47:15,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:15,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 10:47:15,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 10:47:15,805 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:15,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:15,997 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2021-12-15 10:47:15,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 10:47:15,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-15 10:47:15,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:16,000 INFO L225 Difference]: With dead ends: 74 [2021-12-15 10:47:16,000 INFO L226 Difference]: Without dead ends: 72 [2021-12-15 10:47:16,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-15 10:47:16,002 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 63 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:47:16,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 105 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 10:47:16,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-15 10:47:16,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2021-12-15 10:47:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:16,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2021-12-15 10:47:16,013 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 11 [2021-12-15 10:47:16,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:16,014 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2021-12-15 10:47:16,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:16,014 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2021-12-15 10:47:16,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 10:47:16,015 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:16,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:47:16,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 10:47:16,016 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:16,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:16,016 INFO L85 PathProgramCache]: Analyzing trace with hash 608373907, now seen corresponding path program 1 times [2021-12-15 10:47:16,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:16,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737862382] [2021-12-15 10:47:16,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:16,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:16,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:47:16,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:16,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737862382] [2021-12-15 10:47:16,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737862382] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:47:16,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:47:16,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:47:16,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634405223] [2021-12-15 10:47:16,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:47:16,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:47:16,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:16,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:47:16,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:47:16,071 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:16,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:16,132 INFO L93 Difference]: Finished difference Result 106 states and 140 transitions. [2021-12-15 10:47:16,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 10:47:16,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-15 10:47:16,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:16,134 INFO L225 Difference]: With dead ends: 106 [2021-12-15 10:47:16,134 INFO L226 Difference]: Without dead ends: 57 [2021-12-15 10:47:16,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:47:16,136 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:47:16,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 74 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:47:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-15 10:47:16,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2021-12-15 10:47:16,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:16,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2021-12-15 10:47:16,142 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 11 [2021-12-15 10:47:16,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:16,143 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2021-12-15 10:47:16,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:16,143 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2021-12-15 10:47:16,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-15 10:47:16,144 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:16,144 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:47:16,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 10:47:16,144 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:16,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:16,145 INFO L85 PathProgramCache]: Analyzing trace with hash -2110602732, now seen corresponding path program 1 times [2021-12-15 10:47:16,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:16,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987706936] [2021-12-15 10:47:16,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:16,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:16,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:47:16,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:16,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987706936] [2021-12-15 10:47:16,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987706936] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:47:16,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753799734] [2021-12-15 10:47:16,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:16,248 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:16,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:47:16,255 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) [2021-12-15 10:47:16,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 10:47:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:16,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-15 10:47:16,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:47:16,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-15 10:47:16,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:16,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:16,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 26 [2021-12-15 10:47:16,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:16,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:16,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 26 [2021-12-15 10:47:16,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 26 treesize of output 21 [2021-12-15 10:47:16,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 30 treesize of output 25 [2021-12-15 10:47:16,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 17 [2021-12-15 10:47:16,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 17 [2021-12-15 10:47:16,617 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-15 10:47:16,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-15 10:47:16,755 INFO L354 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2021-12-15 10:47:16,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 40 [2021-12-15 10:47:16,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2021-12-15 10:47:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:47:16,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:47:16,911 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_146 Int)) (or (not (= 0 (select |c_#valid| v_ArrVal_146))) (and (forall ((v_ArrVal_147 Int) (v_ArrVal_143 (Array Int Int))) (= (let ((.cse1 (+ v_ArrVal_147 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| v_ArrVal_146 (store v_ArrVal_143 .cse1 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_146 v_ArrVal_143) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_147))) v_ArrVal_146) .cse1)) 0)) (forall ((v_ArrVal_147 Int) (v_ArrVal_152 (Array Int Int)) (v_ArrVal_154 (Array Int Int))) (= (let ((.cse2 (+ v_ArrVal_147 8))) (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_146 (store v_ArrVal_154 .cse2 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_146 v_ArrVal_154) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_146 v_ArrVal_152) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_146)) v_ArrVal_146) .cse2)) 0))))) is different from false [2021-12-15 10:47:17,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:47:17,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753799734] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:47:17,043 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:47:17,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2021-12-15 10:47:17,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475445061] [2021-12-15 10:47:17,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:47:17,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 10:47:17,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:17,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 10:47:17,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2021-12-15 10:47:17,045 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:17,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:17,241 INFO L93 Difference]: Finished difference Result 121 states and 160 transitions. [2021-12-15 10:47:17,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 10:47:17,246 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-15 10:47:17,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:17,247 INFO L225 Difference]: With dead ends: 121 [2021-12-15 10:47:17,247 INFO L226 Difference]: Without dead ends: 83 [2021-12-15 10:47:17,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=99, Unknown=1, NotChecked=20, Total=156 [2021-12-15 10:47:17,248 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 40 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:47:17,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 209 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 44 Unchecked, 0.1s Time] [2021-12-15 10:47:17,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-15 10:47:17,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 54. [2021-12-15 10:47:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:17,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2021-12-15 10:47:17,266 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 14 [2021-12-15 10:47:17,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:17,266 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2021-12-15 10:47:17,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:17,267 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2021-12-15 10:47:17,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 10:47:17,268 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:17,268 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:47:17,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-15 10:47:17,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:17,494 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:17,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:17,494 INFO L85 PathProgramCache]: Analyzing trace with hash 969563825, now seen corresponding path program 1 times [2021-12-15 10:47:17,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:17,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038855757] [2021-12-15 10:47:17,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:17,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:17,553 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:47:17,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:17,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038855757] [2021-12-15 10:47:17,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038855757] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:47:17,554 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:47:17,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:47:17,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82162984] [2021-12-15 10:47:17,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:47:17,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:47:17,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:17,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:47:17,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:47:17,556 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:17,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:17,599 INFO L93 Difference]: Finished difference Result 117 states and 155 transitions. [2021-12-15 10:47:17,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:47:17,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-15 10:47:17,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:17,601 INFO L225 Difference]: With dead ends: 117 [2021-12-15 10:47:17,601 INFO L226 Difference]: Without dead ends: 79 [2021-12-15 10:47:17,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:47:17,602 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 29 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:47:17,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 75 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:47:17,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-12-15 10:47:17,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2021-12-15 10:47:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2021-12-15 10:47:17,610 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 19 [2021-12-15 10:47:17,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:17,611 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2021-12-15 10:47:17,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:17,611 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2021-12-15 10:47:17,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-15 10:47:17,612 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:17,612 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:47:17,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 10:47:17,612 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:17,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:17,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1377311315, now seen corresponding path program 1 times [2021-12-15 10:47:17,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:17,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666986962] [2021-12-15 10:47:17,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:17,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:17,751 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 10:47:17,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:17,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666986962] [2021-12-15 10:47:17,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666986962] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:47:17,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758431626] [2021-12-15 10:47:17,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:17,753 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:17,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:47:17,754 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) [2021-12-15 10:47:17,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-15 10:47:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:17,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-15 10:47:17,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:47:18,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2021-12-15 10:47:18,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:18,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:18,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2021-12-15 10:47:18,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:18,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:18,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2021-12-15 10:47:18,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-15 10:47:18,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:18,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2021-12-15 10:47:18,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-15 10:47:18,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2021-12-15 10:47:18,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 16 [2021-12-15 10:47:18,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-15 10:47:18,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 10:47:18,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:47:18,227 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:47:18,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 35 [2021-12-15 10:47:18,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 21 [2021-12-15 10:47:18,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 7 [2021-12-15 10:47:18,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 10:47:18,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758431626] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:47:18,368 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:47:18,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2021-12-15 10:47:18,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583886735] [2021-12-15 10:47:18,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:47:18,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-15 10:47:18,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:18,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-15 10:47:18,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-12-15 10:47:18,371 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:19,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:19,156 INFO L93 Difference]: Finished difference Result 252 states and 333 transitions. [2021-12-15 10:47:19,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-15 10:47:19,156 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-15 10:47:19,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:19,158 INFO L225 Difference]: With dead ends: 252 [2021-12-15 10:47:19,158 INFO L226 Difference]: Without dead ends: 198 [2021-12-15 10:47:19,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=298, Invalid=824, Unknown=0, NotChecked=0, Total=1122 [2021-12-15 10:47:19,159 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 214 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 10:47:19,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 309 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-15 10:47:19,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-15 10:47:19,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 91. [2021-12-15 10:47:19,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.3) internal successors, (117), 90 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:19,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2021-12-15 10:47:19,170 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 22 [2021-12-15 10:47:19,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:19,170 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2021-12-15 10:47:19,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2021-12-15 10:47:19,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 10:47:19,171 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:19,171 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-15 10:47:19,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-15 10:47:19,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-15 10:47:19,388 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:19,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:19,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1662719123, now seen corresponding path program 2 times [2021-12-15 10:47:19,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:19,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369624044] [2021-12-15 10:47:19,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:19,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:19,752 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:47:19,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:19,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369624044] [2021-12-15 10:47:19,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369624044] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:47:19,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229654433] [2021-12-15 10:47:19,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 10:47:19,753 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:19,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:47:19,755 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 10:47:19,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-15 10:47:19,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 10:47:19,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 10:47:19,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 120 conjunts are in the unsatisfiable core [2021-12-15 10:47:19,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:47:19,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-15 10:47:19,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:19,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:19,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2021-12-15 10:47:19,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:19,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:19,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2021-12-15 10:47:19,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-15 10:47:19,992 INFO L354 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2021-12-15 10:47:19,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2021-12-15 10:47:19,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-15 10:47:20,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:20,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:20,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 39 [2021-12-15 10:47:20,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:20,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:20,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 45 [2021-12-15 10:47:20,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:20,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:20,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2021-12-15 10:47:20,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 45 treesize of output 36 [2021-12-15 10:47:20,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 39 treesize of output 32 [2021-12-15 10:47:20,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-15 10:47:20,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2021-12-15 10:47:20,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:20,358 INFO L354 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2021-12-15 10:47:20,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2021-12-15 10:47:20,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:47:20,547 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:47:20,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 50 [2021-12-15 10:47:20,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:20,555 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 10:47:20,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2021-12-15 10:47:20,575 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2021-12-15 10:47:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:47:20,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:47:20,677 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_523 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (v_ArrVal_517 (Array Int Int)) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_525 Int)) (or (<= |c_#StackHeapBarrier| v_ArrVal_525) (<= 1 (select (select (store (store |c_#memory_int| v_ArrVal_525 v_ArrVal_514) |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_513) (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_525 (store v_ArrVal_517 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_525 v_ArrVal_517) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_525 v_ArrVal_523) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_525)) v_ArrVal_525) 8)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_525 (store v_ArrVal_516 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_525 v_ArrVal_516) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_525 v_ArrVal_512) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)) v_ArrVal_525) 8) 4))) (not (= 0 (select |c_#valid| v_ArrVal_525))))) is different from false [2021-12-15 10:47:20,887 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:47:20,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 377 treesize of output 380 [2021-12-15 10:47:20,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 306 treesize of output 242 [2021-12-15 10:47:20,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 136 treesize of output 104 [2021-12-15 10:47:21,683 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:47:21,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 391 treesize of output 385 [2021-12-15 10:47:21,709 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:47:21,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 374 treesize of output 372 [2021-12-15 10:47:21,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 344 treesize of output 338 [2021-12-15 10:47:21,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 361 treesize of output 355 [2021-12-15 10:47:21,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 371 treesize of output 367 [2021-12-15 10:47:21,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 367 treesize of output 363 [2021-12-15 10:47:21,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 363 treesize of output 361 [2021-12-15 10:47:21,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 361 treesize of output 357 [2021-12-15 10:47:21,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 369 treesize of output 365 [2021-12-15 10:47:21,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 368 treesize of output 366 [2021-12-15 10:47:21,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 371 treesize of output 369 [2021-12-15 10:47:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2021-12-15 10:47:22,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229654433] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:47:22,203 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:47:22,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2021-12-15 10:47:22,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620646562] [2021-12-15 10:47:22,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:47:22,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-15 10:47:22,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:22,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-15 10:47:22,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=551, Unknown=5, NotChecked=48, Total=702 [2021-12-15 10:47:22,205 INFO L87 Difference]: Start difference. First operand 91 states and 117 transitions. Second operand has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:23,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:23,872 INFO L93 Difference]: Finished difference Result 327 states and 432 transitions. [2021-12-15 10:47:23,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-15 10:47:23,873 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-15 10:47:23,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:23,875 INFO L225 Difference]: With dead ends: 327 [2021-12-15 10:47:23,875 INFO L226 Difference]: Without dead ends: 325 [2021-12-15 10:47:23,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 37 SyntacticMatches, 11 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=305, Invalid=1758, Unknown=11, NotChecked=88, Total=2162 [2021-12-15 10:47:23,876 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 314 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 309 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 10:47:23,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 478 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 316 Invalid, 0 Unknown, 309 Unchecked, 0.4s Time] [2021-12-15 10:47:23,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-12-15 10:47:23,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 173. [2021-12-15 10:47:23,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 1.2965116279069768) internal successors, (223), 172 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:23,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 223 transitions. [2021-12-15 10:47:23,890 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 223 transitions. Word has length 25 [2021-12-15 10:47:23,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:23,890 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 223 transitions. [2021-12-15 10:47:23,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:23,891 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 223 transitions. [2021-12-15 10:47:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 10:47:23,892 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:23,892 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-15 10:47:23,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-15 10:47:24,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:24,108 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:24,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:24,108 INFO L85 PathProgramCache]: Analyzing trace with hash 211481171, now seen corresponding path program 3 times [2021-12-15 10:47:24,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:24,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294953039] [2021-12-15 10:47:24,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:24,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:47:24,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:24,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294953039] [2021-12-15 10:47:24,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294953039] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:47:24,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312459992] [2021-12-15 10:47:24,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 10:47:24,457 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:24,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:47:24,458 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 10:47:24,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-15 10:47:24,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-15 10:47:24,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 10:47:24,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 121 conjunts are in the unsatisfiable core [2021-12-15 10:47:24,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:47:24,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:24,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:24,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 24 [2021-12-15 10:47:24,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:24,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:24,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 24 [2021-12-15 10:47:24,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 24 treesize of output 19 [2021-12-15 10:47:25,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 23 [2021-12-15 10:47:25,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2021-12-15 10:47:25,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2021-12-15 10:47:25,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2021-12-15 10:47:25,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:25,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:25,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:25,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:25,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 38 [2021-12-15 10:47:25,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:25,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:25,334 INFO L354 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2021-12-15 10:47:25,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 57 [2021-12-15 10:47:25,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 51 treesize of output 40 [2021-12-15 10:47:25,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 23 [2021-12-15 10:47:25,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2021-12-15 10:47:25,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2021-12-15 10:47:25,369 INFO L354 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2021-12-15 10:47:25,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2021-12-15 10:47:25,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:47:25,689 INFO L354 Elim1Store]: treesize reduction 67, result has 9.5 percent of original size [2021-12-15 10:47:25,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 154 treesize of output 84 [2021-12-15 10:47:25,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:25,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:25,707 INFO L354 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2021-12-15 10:47:25,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 29 [2021-12-15 10:47:25,715 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 10:47:25,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:47:26,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2021-12-15 10:47:27,302 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_662 Int) (v_ArrVal_690 Int)) (or (and (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_688 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (= 0 (select (let ((.cse0 (let ((.cse1 (store (store |c_#memory_$Pointer$.base| v_ArrVal_662 (store v_ArrVal_666 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_662 v_ArrVal_666) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_662 v_ArrVal_674) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_662)))) (store (store .cse1 v_ArrVal_690 (store v_ArrVal_682 8 (select (select (store .cse1 v_ArrVal_690 v_ArrVal_682) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse1 v_ArrVal_690 v_ArrVal_691) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_690))))) (select .cse0 (select (select .cse0 v_ArrVal_690) 8))) (+ (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_662 (store v_ArrVal_676 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_662 v_ArrVal_676) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_662 v_ArrVal_670) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (store (store .cse2 v_ArrVal_690 (store v_ArrVal_684 8 (select (select (store .cse2 v_ArrVal_690 v_ArrVal_684) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse2 v_ArrVal_690 v_ArrVal_688) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))) v_ArrVal_690) 8) 8)))) (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_688 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (= (let ((.cse3 (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_662 (store v_ArrVal_676 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_662 v_ArrVal_676) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_662 v_ArrVal_670) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (store (store .cse5 v_ArrVal_690 (store v_ArrVal_684 8 (select (select (store .cse5 v_ArrVal_690 v_ArrVal_684) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse5 v_ArrVal_690 v_ArrVal_688) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))))) (select (select .cse3 (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| v_ArrVal_662 (store v_ArrVal_666 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_662 v_ArrVal_666) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_662 v_ArrVal_674) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_662)))) (store (store .cse4 v_ArrVal_690 (store v_ArrVal_682 8 (select (select (store .cse4 v_ArrVal_690 v_ArrVal_682) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse4 v_ArrVal_690 v_ArrVal_691) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_690))) v_ArrVal_690) 8)) (+ (select (select .cse3 v_ArrVal_690) 8) 8))) 0))) (= v_ArrVal_690 v_ArrVal_662) (<= |c_#StackHeapBarrier| v_ArrVal_662) (<= |c_#StackHeapBarrier| v_ArrVal_690))) is different from false [2021-12-15 10:47:28,682 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2021-12-15 10:47:28,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312459992] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:47:28,683 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:47:28,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2021-12-15 10:47:28,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986073701] [2021-12-15 10:47:28,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:47:28,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-15 10:47:28,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:28,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-15 10:47:28,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=260, Unknown=1, NotChecked=32, Total=342 [2021-12-15 10:47:28,685 INFO L87 Difference]: Start difference. First operand 173 states and 223 transitions. Second operand has 19 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:30,979 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#queue~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#queue~0#1.base|) (forall ((v_ArrVal_662 Int) (v_ArrVal_690 Int)) (or (and (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_688 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (= 0 (select (let ((.cse0 (let ((.cse1 (store (store |c_#memory_$Pointer$.base| v_ArrVal_662 (store v_ArrVal_666 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_662 v_ArrVal_666) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_662 v_ArrVal_674) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_662)))) (store (store .cse1 v_ArrVal_690 (store v_ArrVal_682 8 (select (select (store .cse1 v_ArrVal_690 v_ArrVal_682) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse1 v_ArrVal_690 v_ArrVal_691) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_690))))) (select .cse0 (select (select .cse0 v_ArrVal_690) 8))) (+ (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_662 (store v_ArrVal_676 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_662 v_ArrVal_676) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_662 v_ArrVal_670) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (store (store .cse2 v_ArrVal_690 (store v_ArrVal_684 8 (select (select (store .cse2 v_ArrVal_690 v_ArrVal_684) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse2 v_ArrVal_690 v_ArrVal_688) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))) v_ArrVal_690) 8) 8)))) (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_688 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (= (let ((.cse3 (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_662 (store v_ArrVal_676 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_662 v_ArrVal_676) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_662 v_ArrVal_670) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (store (store .cse5 v_ArrVal_690 (store v_ArrVal_684 8 (select (select (store .cse5 v_ArrVal_690 v_ArrVal_684) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse5 v_ArrVal_690 v_ArrVal_688) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))))) (select (select .cse3 (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| v_ArrVal_662 (store v_ArrVal_666 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_662 v_ArrVal_666) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_662 v_ArrVal_674) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_662)))) (store (store .cse4 v_ArrVal_690 (store v_ArrVal_682 8 (select (select (store .cse4 v_ArrVal_690 v_ArrVal_682) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse4 v_ArrVal_690 v_ArrVal_691) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_690))) v_ArrVal_690) 8)) (+ (select (select .cse3 v_ArrVal_690) 8) 8))) 0))) (= v_ArrVal_690 v_ArrVal_662) (<= |c_#StackHeapBarrier| v_ArrVal_662) (<= |c_#StackHeapBarrier| v_ArrVal_690))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#queue~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#queue~0#1.offset|)) is different from false [2021-12-15 10:47:31,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:31,247 INFO L93 Difference]: Finished difference Result 307 states and 398 transitions. [2021-12-15 10:47:31,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 10:47:31,248 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-15 10:47:31,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:31,249 INFO L225 Difference]: With dead ends: 307 [2021-12-15 10:47:31,249 INFO L226 Difference]: Without dead ends: 232 [2021-12-15 10:47:31,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=79, Invalid=389, Unknown=2, NotChecked=82, Total=552 [2021-12-15 10:47:31,250 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 57 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:47:31,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 244 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 66 Unchecked, 0.1s Time] [2021-12-15 10:47:31,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-12-15 10:47:31,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 223. [2021-12-15 10:47:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.2792792792792793) internal successors, (284), 222 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 284 transitions. [2021-12-15 10:47:31,264 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 284 transitions. Word has length 28 [2021-12-15 10:47:31,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:31,265 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 284 transitions. [2021-12-15 10:47:31,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:31,265 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 284 transitions. [2021-12-15 10:47:31,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 10:47:31,266 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:31,266 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:47:31,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-15 10:47:31,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:31,479 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:31,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:31,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1324510600, now seen corresponding path program 1 times [2021-12-15 10:47:31,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:31,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923344216] [2021-12-15 10:47:31,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:31,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:31,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 10:47:31,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:31,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923344216] [2021-12-15 10:47:31,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923344216] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:47:31,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435817259] [2021-12-15 10:47:31,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:31,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:31,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:47:31,531 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 10:47:31,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-15 10:47:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:31,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 10:47:31,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:47:31,702 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 10:47:31,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:47:31,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-15 10:47:31,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435817259] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:47:31,769 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:47:31,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2021-12-15 10:47:31,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160576696] [2021-12-15 10:47:31,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:47:31,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 10:47:31,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:31,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 10:47:31,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-15 10:47:31,771 INFO L87 Difference]: Start difference. First operand 223 states and 284 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:31,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:31,871 INFO L93 Difference]: Finished difference Result 582 states and 758 transitions. [2021-12-15 10:47:31,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 10:47:31,872 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-15 10:47:31,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:31,874 INFO L225 Difference]: With dead ends: 582 [2021-12-15 10:47:31,875 INFO L226 Difference]: Without dead ends: 430 [2021-12-15 10:47:31,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2021-12-15 10:47:31,876 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 82 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:47:31,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 148 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 10:47:31,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2021-12-15 10:47:31,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 375. [2021-12-15 10:47:31,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 1.267379679144385) internal successors, (474), 374 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:31,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 474 transitions. [2021-12-15 10:47:31,896 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 474 transitions. Word has length 29 [2021-12-15 10:47:31,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:31,896 INFO L470 AbstractCegarLoop]: Abstraction has 375 states and 474 transitions. [2021-12-15 10:47:31,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:31,897 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 474 transitions. [2021-12-15 10:47:31,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 10:47:31,897 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:31,898 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:47:31,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-15 10:47:32,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-15 10:47:32,112 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:32,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:32,112 INFO L85 PathProgramCache]: Analyzing trace with hash -313393350, now seen corresponding path program 1 times [2021-12-15 10:47:32,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:32,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362661746] [2021-12-15 10:47:32,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:32,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:32,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:47:32,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:32,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362661746] [2021-12-15 10:47:32,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362661746] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:47:32,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60757327] [2021-12-15 10:47:32,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:32,250 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:32,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:47:32,252 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 10:47:32,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-15 10:47:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:32,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-15 10:47:32,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:47:32,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-15 10:47:32,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2021-12-15 10:47:32,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:32,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:32,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2021-12-15 10:47:32,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:32,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:32,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2021-12-15 10:47:32,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-15 10:47:32,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:32,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2021-12-15 10:47:32,476 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-15 10:47:32,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-15 10:47:32,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-15 10:47:32,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 15 [2021-12-15 10:47:32,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2021-12-15 10:47:32,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2021-12-15 10:47:32,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 10:47:32,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:47:32,741 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:47:32,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 35 [2021-12-15 10:47:32,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 22 [2021-12-15 10:47:32,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 7 [2021-12-15 10:47:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 10:47:32,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60757327] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:47:32,826 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:47:32,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2021-12-15 10:47:32,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459964488] [2021-12-15 10:47:32,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:47:32,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 10:47:32,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:32,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 10:47:32,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-15 10:47:32,827 INFO L87 Difference]: Start difference. First operand 375 states and 474 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:33,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:33,281 INFO L93 Difference]: Finished difference Result 591 states and 750 transitions. [2021-12-15 10:47:33,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 10:47:33,282 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-15 10:47:33,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:33,284 INFO L225 Difference]: With dead ends: 591 [2021-12-15 10:47:33,284 INFO L226 Difference]: Without dead ends: 436 [2021-12-15 10:47:33,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2021-12-15 10:47:33,285 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 82 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 10:47:33,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 276 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 239 Invalid, 0 Unknown, 34 Unchecked, 0.2s Time] [2021-12-15 10:47:33,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2021-12-15 10:47:33,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 378. [2021-12-15 10:47:33,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 1.2679045092838197) internal successors, (478), 377 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:33,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 478 transitions. [2021-12-15 10:47:33,303 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 478 transitions. Word has length 29 [2021-12-15 10:47:33,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:33,304 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 478 transitions. [2021-12-15 10:47:33,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:33,304 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 478 transitions. [2021-12-15 10:47:33,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-15 10:47:33,305 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:33,305 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:47:33,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-15 10:47:33,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:33,529 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:33,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:33,530 INFO L85 PathProgramCache]: Analyzing trace with hash -190827821, now seen corresponding path program 1 times [2021-12-15 10:47:33,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:33,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868152602] [2021-12-15 10:47:33,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:33,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:47:33,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:33,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868152602] [2021-12-15 10:47:33,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868152602] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:47:33,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737684078] [2021-12-15 10:47:33,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:33,675 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:33,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:47:33,680 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 10:47:33,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-15 10:47:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:33,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-15 10:47:33,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:47:33,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-15 10:47:33,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:33,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:33,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2021-12-15 10:47:33,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-15 10:47:33,871 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-15 10:47:33,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-15 10:47:34,004 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-12-15 10:47:34,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 24 [2021-12-15 10:47:34,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 17 [2021-12-15 10:47:34,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 10 [2021-12-15 10:47:34,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 10 [2021-12-15 10:47:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 10:47:34,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:47:34,337 INFO L354 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2021-12-15 10:47:34,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 60 [2021-12-15 10:47:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 10:47:34,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737684078] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:47:34,464 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:47:34,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 19 [2021-12-15 10:47:34,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270356373] [2021-12-15 10:47:34,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:47:34,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-15 10:47:34,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:34,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-15 10:47:34,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2021-12-15 10:47:34,466 INFO L87 Difference]: Start difference. First operand 378 states and 478 transitions. Second operand has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:35,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:35,263 INFO L93 Difference]: Finished difference Result 916 states and 1200 transitions. [2021-12-15 10:47:35,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-15 10:47:35,263 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-15 10:47:35,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:35,266 INFO L225 Difference]: With dead ends: 916 [2021-12-15 10:47:35,266 INFO L226 Difference]: Without dead ends: 642 [2021-12-15 10:47:35,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=328, Invalid=1312, Unknown=0, NotChecked=0, Total=1640 [2021-12-15 10:47:35,267 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 272 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 10:47:35,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 471 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 265 Invalid, 0 Unknown, 146 Unchecked, 0.3s Time] [2021-12-15 10:47:35,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2021-12-15 10:47:35,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 474. [2021-12-15 10:47:35,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 1.2896405919661733) internal successors, (610), 473 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 610 transitions. [2021-12-15 10:47:35,289 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 610 transitions. Word has length 30 [2021-12-15 10:47:35,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:35,289 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 610 transitions. [2021-12-15 10:47:35,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:35,290 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 610 transitions. [2021-12-15 10:47:35,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-15 10:47:35,290 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:35,290 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:47:35,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-15 10:47:35,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:35,508 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:35,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:35,508 INFO L85 PathProgramCache]: Analyzing trace with hash -583854831, now seen corresponding path program 1 times [2021-12-15 10:47:35,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:35,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956238310] [2021-12-15 10:47:35,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:35,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 10:47:35,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:35,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956238310] [2021-12-15 10:47:35,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956238310] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:47:35,550 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:47:35,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 10:47:35,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318235135] [2021-12-15 10:47:35,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:47:35,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 10:47:35,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:35,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 10:47:35,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 10:47:35,552 INFO L87 Difference]: Start difference. First operand 474 states and 610 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:35,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:35,581 INFO L93 Difference]: Finished difference Result 1010 states and 1304 transitions. [2021-12-15 10:47:35,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 10:47:35,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-15 10:47:35,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:35,585 INFO L225 Difference]: With dead ends: 1010 [2021-12-15 10:47:35,585 INFO L226 Difference]: Without dead ends: 650 [2021-12-15 10:47:35,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 10:47:35,587 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 22 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:47:35,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 75 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:47:35,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2021-12-15 10:47:35,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 471. [2021-12-15 10:47:35,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 1.274468085106383) internal successors, (599), 470 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 599 transitions. [2021-12-15 10:47:35,609 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 599 transitions. Word has length 30 [2021-12-15 10:47:35,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:35,610 INFO L470 AbstractCegarLoop]: Abstraction has 471 states and 599 transitions. [2021-12-15 10:47:35,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:35,610 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 599 transitions. [2021-12-15 10:47:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-15 10:47:35,610 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:35,611 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:47:35,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 10:47:35,611 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:35,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:35,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1070079280, now seen corresponding path program 1 times [2021-12-15 10:47:35,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:35,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664574059] [2021-12-15 10:47:35,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:35,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:47:35,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:35,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664574059] [2021-12-15 10:47:35,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664574059] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:47:35,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506986595] [2021-12-15 10:47:35,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:35,809 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:35,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:47:35,810 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 10:47:35,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-15 10:47:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:35,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 77 conjunts are in the unsatisfiable core [2021-12-15 10:47:35,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:47:35,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-15 10:47:36,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:36,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:36,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 24 [2021-12-15 10:47:36,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:36,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:36,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 24 [2021-12-15 10:47:36,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 24 treesize of output 19 [2021-12-15 10:47:36,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 23 [2021-12-15 10:47:36,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2021-12-15 10:47:36,083 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-15 10:47:36,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-15 10:47:36,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2021-12-15 10:47:36,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 30 [2021-12-15 10:47:36,313 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-15 10:47:36,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 41 [2021-12-15 10:47:36,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 24 treesize of output 18 [2021-12-15 10:47:36,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2021-12-15 10:47:36,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2021-12-15 10:47:36,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2021-12-15 10:47:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 10:47:36,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:47:36,411 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1106 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_choose_next_~q#1.base| v_ArrVal_1106) |c_ULTIMATE.start_choose_next_~node~0#1.base|) (+ |c_ULTIMATE.start_choose_next_~node~0#1.offset| 8)) 0)) (forall ((v_ArrVal_1105 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_choose_next_~q#1.base| v_ArrVal_1105) |c_ULTIMATE.start_choose_next_~node~0#1.base|) (+ |c_ULTIMATE.start_choose_next_~node~0#1.offset| 8)) 0))) is different from false [2021-12-15 10:47:36,428 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1106 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1106) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 8)) 0)) (forall ((v_ArrVal_1105 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1105) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 8)) 0))) is different from false [2021-12-15 10:47:36,619 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2021-12-15 10:47:36,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506986595] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:47:36,620 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:47:36,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 17 [2021-12-15 10:47:36,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185040571] [2021-12-15 10:47:36,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:47:36,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-15 10:47:36,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:47:36,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 10:47:36,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=174, Unknown=2, NotChecked=54, Total=272 [2021-12-15 10:47:36,622 INFO L87 Difference]: Start difference. First operand 471 states and 599 transitions. Second operand has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:37,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:47:37,139 INFO L93 Difference]: Finished difference Result 693 states and 888 transitions. [2021-12-15 10:47:37,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 10:47:37,140 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-15 10:47:37,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:47:37,142 INFO L225 Difference]: With dead ends: 693 [2021-12-15 10:47:37,142 INFO L226 Difference]: Without dead ends: 555 [2021-12-15 10:47:37,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=414, Unknown=2, NotChecked=86, Total=600 [2021-12-15 10:47:37,143 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 63 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 10:47:37,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 345 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 146 Invalid, 0 Unknown, 108 Unchecked, 0.2s Time] [2021-12-15 10:47:37,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-12-15 10:47:37,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 474. [2021-12-15 10:47:37,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 1.2727272727272727) internal successors, (602), 473 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:37,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 602 transitions. [2021-12-15 10:47:37,166 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 602 transitions. Word has length 33 [2021-12-15 10:47:37,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:47:37,166 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 602 transitions. [2021-12-15 10:47:37,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:47:37,167 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 602 transitions. [2021-12-15 10:47:37,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-15 10:47:37,167 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:47:37,167 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-15 10:47:37,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-15 10:47:37,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-15 10:47:37,392 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:47:37,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:47:37,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1607684877, now seen corresponding path program 1 times [2021-12-15 10:47:37,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:47:37,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556264900] [2021-12-15 10:47:37,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:37,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:47:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:37,648 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-15 10:47:37,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:47:37,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556264900] [2021-12-15 10:47:37,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556264900] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:47:37,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938930368] [2021-12-15 10:47:37,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:47:37,649 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:47:37,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:47:37,650 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 10:47:37,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-15 10:47:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:47:37,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 128 conjunts are in the unsatisfiable core [2021-12-15 10:47:37,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:47:37,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-15 10:47:37,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:37,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:37,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 24 [2021-12-15 10:47:37,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:37,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:37,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2021-12-15 10:47:37,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-15 10:47:37,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 23 [2021-12-15 10:47:37,941 INFO L354 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2021-12-15 10:47:37,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2021-12-15 10:47:37,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2021-12-15 10:47:38,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:38,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:38,261 INFO L354 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2021-12-15 10:47:38,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 64 [2021-12-15 10:47:38,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:38,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:38,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:38,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 51 [2021-12-15 10:47:38,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 56 treesize of output 45 [2021-12-15 10:47:38,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 41 treesize of output 34 [2021-12-15 10:47:38,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-12-15 10:47:38,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:38,302 INFO L354 Elim1Store]: treesize reduction 4, result has 84.6 percent of original size [2021-12-15 10:47:38,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2021-12-15 10:47:38,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 17 [2021-12-15 10:47:38,551 INFO L354 Elim1Store]: treesize reduction 72, result has 4.0 percent of original size [2021-12-15 10:47:38,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 183 treesize of output 83 [2021-12-15 10:47:38,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:47:38,559 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 10:47:38,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 23 [2021-12-15 10:47:38,567 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-15 10:47:38,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:47:39,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 10:47:40,115 INFO L354 Elim1Store]: treesize reduction 194, result has 48.8 percent of original size [2021-12-15 10:47:40,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 841234 treesize of output 836917 [2021-12-15 10:47:50,895 WARN L227 SmtUtils]: Spent 10.78s on a formula simplification. DAG size of input: 1155 DAG size of output: 1135 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-15 10:47:51,155 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:47:51,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 792191 treesize of output 765267 [2021-12-15 10:47:52,150 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:47:52,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1195869 treesize of output 994485 [2021-12-15 10:48:05,881 WARN L227 SmtUtils]: Spent 13.73s on a formula simplification. DAG size of input: 1208 DAG size of output: 1206 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-15 10:48:07,073 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 10:48:07,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2115340 treesize of output 1817238 [2021-12-15 10:48:16,221 WARN L227 SmtUtils]: Spent 9.14s on a formula simplification. DAG size of input: 1237 DAG size of output: 1224 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-15 10:48:16,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1792358 treesize of output 1792346 [2021-12-15 10:48:18,023 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-15 10:48:18,024 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-15 10:48:18,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2021-12-15 10:48:18,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291625880] [2021-12-15 10:48:18,024 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-15 10:48:18,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 10:48:18,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:48:18,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 10:48:18,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-12-15 10:48:18,025 INFO L87 Difference]: Start difference. First operand 474 states and 602 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:48:18,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:48:18,565 INFO L93 Difference]: Finished difference Result 856 states and 1097 transitions. [2021-12-15 10:48:18,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 10:48:18,566 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-15 10:48:18,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:48:18,567 INFO L225 Difference]: With dead ends: 856 [2021-12-15 10:48:18,568 INFO L226 Difference]: Without dead ends: 499 [2021-12-15 10:48:18,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2021-12-15 10:48:18,569 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 101 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 10:48:18,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 258 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 10:48:18,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2021-12-15 10:48:18,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 477. [2021-12-15 10:48:18,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 1.2710084033613445) internal successors, (605), 476 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:48:18,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 605 transitions. [2021-12-15 10:48:18,592 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 605 transitions. Word has length 36 [2021-12-15 10:48:18,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:48:18,593 INFO L470 AbstractCegarLoop]: Abstraction has 477 states and 605 transitions. [2021-12-15 10:48:18,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:48:18,593 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 605 transitions. [2021-12-15 10:48:18,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-15 10:48:18,594 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:48:18,594 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:48:18,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-15 10:48:18,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-15 10:48:18,817 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:48:18,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:48:18,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1610537933, now seen corresponding path program 1 times [2021-12-15 10:48:18,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:48:18,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143124529] [2021-12-15 10:48:18,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:48:18,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:48:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:48:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-15 10:48:18,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:48:18,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143124529] [2021-12-15 10:48:18,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143124529] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:48:18,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215065600] [2021-12-15 10:48:18,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:48:18,881 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:48:18,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:48:18,883 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 10:48:18,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-15 10:48:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:48:19,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-15 10:48:19,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:48:19,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2021-12-15 10:48:19,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2021-12-15 10:48:19,153 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-15 10:48:19,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:48:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-15 10:48:19,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215065600] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:48:19,256 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:48:19,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2021-12-15 10:48:19,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737454679] [2021-12-15 10:48:19,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:48:19,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 10:48:19,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:48:19,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 10:48:19,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-15 10:48:19,257 INFO L87 Difference]: Start difference. First operand 477 states and 605 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:48:19,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:48:19,351 INFO L93 Difference]: Finished difference Result 973 states and 1255 transitions. [2021-12-15 10:48:19,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 10:48:19,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-15 10:48:19,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:48:19,354 INFO L225 Difference]: With dead ends: 973 [2021-12-15 10:48:19,355 INFO L226 Difference]: Without dead ends: 616 [2021-12-15 10:48:19,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-15 10:48:19,356 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 77 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:48:19,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 83 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 10:48:19,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2021-12-15 10:48:19,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 507. [2021-12-15 10:48:19,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 506 states have (on average 1.2924901185770752) internal successors, (654), 506 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:48:19,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 654 transitions. [2021-12-15 10:48:19,384 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 654 transitions. Word has length 38 [2021-12-15 10:48:19,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:48:19,384 INFO L470 AbstractCegarLoop]: Abstraction has 507 states and 654 transitions. [2021-12-15 10:48:19,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:48:19,385 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 654 transitions. [2021-12-15 10:48:19,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-15 10:48:19,386 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:48:19,386 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2021-12-15 10:48:19,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-15 10:48:19,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-15 10:48:19,609 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:48:19,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:48:19,610 INFO L85 PathProgramCache]: Analyzing trace with hash 325417618, now seen corresponding path program 4 times [2021-12-15 10:48:19,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:48:19,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525893074] [2021-12-15 10:48:19,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:48:19,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:48:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:48:19,747 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 39 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-15 10:48:19,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:48:19,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525893074] [2021-12-15 10:48:19,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525893074] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:48:19,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187180594] [2021-12-15 10:48:19,747 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 10:48:19,748 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:48:19,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:48:19,749 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 10:48:19,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-15 10:48:19,945 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 10:48:19,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 10:48:19,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 73 conjunts are in the unsatisfiable core [2021-12-15 10:48:19,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:48:20,028 INFO L354 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-15 10:48:20,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 36 treesize of output 51 [2021-12-15 10:48:20,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-15 10:48:20,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-15 10:48:20,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2021-12-15 10:48:20,083 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-15 10:48:20,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2021-12-15 10:48:20,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 16 [2021-12-15 10:48:20,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:48:20,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:48:20,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2021-12-15 10:48:20,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:48:20,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 10:48:20,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 27 [2021-12-15 10:48:20,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 27 treesize of output 22 [2021-12-15 10:48:20,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2021-12-15 10:48:20,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-15 10:48:20,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 18 [2021-12-15 10:48:20,281 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-12-15 10:48:20,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 16 [2021-12-15 10:48:20,305 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 39 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-15 10:48:20,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:48:20,362 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int)) (|v_ULTIMATE.start_main_~new_process~0#1.base_23| Int) (|v_ULTIMATE.start_append_to_queue_~n#1.offset_16| Int)) (or (not (= (let ((.cse1 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_16| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~new_process~0#1.base_23| (store v_ArrVal_1548 .cse1 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~new_process~0#1.base_23| v_ArrVal_1548) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_main_~new_process~0#1.base_23|))) |v_ULTIMATE.start_main_~new_process~0#1.base_23|) .cse1)) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~new_process~0#1.base_23|))) is different from false [2021-12-15 10:48:20,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 208 treesize of output 204 [2021-12-15 10:48:20,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 234 treesize of output 226 [2021-12-15 10:48:20,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 256 treesize of output 248 [2021-12-15 10:48:20,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 260 treesize of output 252 [2021-12-15 10:48:20,529 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 35 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 12 not checked. [2021-12-15 10:48:20,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187180594] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:48:20,530 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:48:20,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2021-12-15 10:48:20,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713914533] [2021-12-15 10:48:20,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:48:20,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-15 10:48:20,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:48:20,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-15 10:48:20,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=143, Unknown=1, NotChecked=24, Total=210 [2021-12-15 10:48:20,532 INFO L87 Difference]: Start difference. First operand 507 states and 654 transitions. Second operand has 15 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:48:20,600 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (and (not (= 0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#queue~0#1.base|) (forall ((v_ArrVal_1548 (Array Int Int)) (|v_ULTIMATE.start_main_~new_process~0#1.base_23| Int) (|v_ULTIMATE.start_append_to_queue_~n#1.offset_16| Int)) (or (not (= (let ((.cse1 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_16| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~new_process~0#1.base_23| (store v_ArrVal_1548 .cse1 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~new_process~0#1.base_23| v_ArrVal_1548) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_main_~new_process~0#1.base_23|))) |v_ULTIMATE.start_main_~new_process~0#1.base_23|) .cse1)) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~new_process~0#1.base_23|))) (<= .cse2 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#queue~0#1.base|) (<= 0 .cse2) (= 0 |c_ULTIMATE.start_main_~#queue~0#1.offset|))) is different from false [2021-12-15 10:48:20,603 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (and (not (= 0 .cse0)) (<= |c_ULTIMATE.start_check_queue_~n~0#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#queue~0#1.base|) (< 0 (+ |c_ULTIMATE.start_check_queue_~n~0#1.offset| 1)) (forall ((v_ArrVal_1548 (Array Int Int)) (|v_ULTIMATE.start_main_~new_process~0#1.base_23| Int) (|v_ULTIMATE.start_append_to_queue_~n#1.offset_16| Int)) (or (not (= (let ((.cse2 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_16| 8))) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~new_process~0#1.base_23| (store v_ArrVal_1548 .cse2 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~new_process~0#1.base_23| v_ArrVal_1548) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse1 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_main_~new_process~0#1.base_23|))) |v_ULTIMATE.start_main_~new_process~0#1.base_23|) .cse2)) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~new_process~0#1.base_23|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#queue~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#queue~0#1.offset|) (= .cse0 |c_ULTIMATE.start_check_queue_~n~0#1.base|))) is different from false [2021-12-15 10:48:20,647 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (forall ((v_ArrVal_1548 (Array Int Int)) (|v_ULTIMATE.start_main_~new_process~0#1.base_23| Int) (|v_ULTIMATE.start_append_to_queue_~n#1.offset_16| Int)) (or (not (= (let ((.cse1 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_16| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~new_process~0#1.base_23| (store v_ArrVal_1548 .cse1 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~new_process~0#1.base_23| v_ArrVal_1548) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| |v_ULTIMATE.start_main_~new_process~0#1.base_23|))) |v_ULTIMATE.start_main_~new_process~0#1.base_23|) .cse1)) 0)) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~new_process~0#1.base_23|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#queue~0#1.base|) (= 0 |c_ULTIMATE.start_main_~#queue~0#1.offset|)) is different from false [2021-12-15 10:48:20,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:48:20,741 INFO L93 Difference]: Finished difference Result 896 states and 1170 transitions. [2021-12-15 10:48:20,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 10:48:20,742 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-15 10:48:20,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:48:20,744 INFO L225 Difference]: With dead ends: 896 [2021-12-15 10:48:20,744 INFO L226 Difference]: Without dead ends: 460 [2021-12-15 10:48:20,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=216, Unknown=4, NotChecked=132, Total=420 [2021-12-15 10:48:20,745 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 23 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:48:20,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 208 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2021-12-15 10:48:20,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-12-15 10:48:20,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 458. [2021-12-15 10:48:20,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.2932166301969366) internal successors, (591), 457 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:48:20,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 591 transitions. [2021-12-15 10:48:20,768 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 591 transitions. Word has length 39 [2021-12-15 10:48:20,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:48:20,769 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 591 transitions. [2021-12-15 10:48:20,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:48:20,769 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 591 transitions. [2021-12-15 10:48:20,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-15 10:48:20,770 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:48:20,770 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:48:20,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-15 10:48:20,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-15 10:48:20,983 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:48:20,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:48:20,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1871575436, now seen corresponding path program 2 times [2021-12-15 10:48:20,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:48:20,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913429983] [2021-12-15 10:48:20,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:48:20,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:48:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:48:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-15 10:48:21,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:48:21,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913429983] [2021-12-15 10:48:21,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913429983] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:48:21,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670499562] [2021-12-15 10:48:21,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 10:48:21,118 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:48:21,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:48:21,120 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)