./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s1lif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/array-fpi/s1lif.c -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 cdcd45f06ced2bb4437693c85186d4d1862b19794596dce357397727796a8cdf --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:27:51,308 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:27:51,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:27:51,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:27:51,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:27:51,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:27:51,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:27:51,352 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:27:51,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:27:51,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:27:51,354 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:27:51,355 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:27:51,355 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:27:51,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:27:51,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:27:51,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:27:51,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:27:51,358 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:27:51,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:27:51,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:27:51,362 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:27:51,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:27:51,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:27:51,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:27:51,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:27:51,367 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:27:51,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:27:51,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:27:51,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:27:51,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:27:51,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:27:51,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:27:51,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:27:51,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:27:51,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:27:51,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:27:51,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:27:51,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:27:51,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:27:51,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:27:51,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:27:51,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:27:51,378 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:27:51,403 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:27:51,405 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:27:51,405 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:27:51,405 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:27:51,406 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:27:51,406 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:27:51,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:27:51,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:27:51,407 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:27:51,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:27:51,407 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:27:51,407 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:27:51,408 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:27:51,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:27:51,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:27:51,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:27:51,408 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:27:51,408 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:27:51,408 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:27:51,408 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:27:51,409 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:27:51,410 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:27:51,410 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:27:51,410 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:27:51,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:27:51,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:27:51,410 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:27:51,411 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:27:51,411 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:27:51,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:27:51,411 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:27:51,411 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:27:51,411 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:27:51,411 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 -> cdcd45f06ced2bb4437693c85186d4d1862b19794596dce357397727796a8cdf [2022-07-11 23:27:51,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:27:51,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:27:51,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:27:51,654 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:27:51,654 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:27:51,655 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s1lif.c [2022-07-11 23:27:51,718 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6abb9a4f4/19527c46148e4657bfb0552c2b03ec81/FLAG7e2e2739b [2022-07-11 23:27:52,007 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:27:52,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s1lif.c [2022-07-11 23:27:52,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6abb9a4f4/19527c46148e4657bfb0552c2b03ec81/FLAG7e2e2739b [2022-07-11 23:27:52,450 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6abb9a4f4/19527c46148e4657bfb0552c2b03ec81 [2022-07-11 23:27:52,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:27:52,453 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:27:52,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:27:52,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:27:52,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:27:52,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:27:52" (1/1) ... [2022-07-11 23:27:52,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce1584f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:27:52, skipping insertion in model container [2022-07-11 23:27:52,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:27:52" (1/1) ... [2022-07-11 23:27:52,464 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:27:52,477 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:27:52,596 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/array-fpi/s1lif.c[588,601] [2022-07-11 23:27:52,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:27:52,615 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:27:52,623 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/array-fpi/s1lif.c[588,601] [2022-07-11 23:27:52,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:27:52,638 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:27:52,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:27:52 WrapperNode [2022-07-11 23:27:52,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:27:52,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:27:52,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:27:52,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:27:52,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:27:52" (1/1) ... [2022-07-11 23:27:52,649 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:27:52" (1/1) ... [2022-07-11 23:27:52,661 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-07-11 23:27:52,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:27:52,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:27:52,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:27:52,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:27:52,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:27:52" (1/1) ... [2022-07-11 23:27:52,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:27:52" (1/1) ... [2022-07-11 23:27:52,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:27:52" (1/1) ... [2022-07-11 23:27:52,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:27:52" (1/1) ... [2022-07-11 23:27:52,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:27:52" (1/1) ... [2022-07-11 23:27:52,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:27:52" (1/1) ... [2022-07-11 23:27:52,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:27:52" (1/1) ... [2022-07-11 23:27:52,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:27:52,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:27:52,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:27:52,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:27:52,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:27:52" (1/1) ... [2022-07-11 23:27:52,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:27:52,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:27:52,713 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) [2022-07-11 23:27:52,719 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 [2022-07-11 23:27:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:27:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:27:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-11 23:27:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:27:52,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:27:52,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:27:52,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:27:52,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:27:52,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-11 23:27:52,797 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:27:52,798 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:27:52,903 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:27:52,907 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:27:52,908 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-11 23:27:52,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:27:52 BoogieIcfgContainer [2022-07-11 23:27:52,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:27:52,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:27:52,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:27:52,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:27:52,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:27:52" (1/3) ... [2022-07-11 23:27:52,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6914d177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:27:52, skipping insertion in model container [2022-07-11 23:27:52,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:27:52" (2/3) ... [2022-07-11 23:27:52,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6914d177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:27:52, skipping insertion in model container [2022-07-11 23:27:52,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:27:52" (3/3) ... [2022-07-11 23:27:52,934 INFO L111 eAbstractionObserver]: Analyzing ICFG s1lif.c [2022-07-11 23:27:52,948 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:27:52,948 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:27:52,991 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:27:52,996 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@424b93c8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@37ca6f30 [2022-07-11 23:27:52,996 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:27:52,999 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 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) [2022-07-11 23:27:53,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-11 23:27:53,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:27:53,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:27:53,004 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:27:53,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:27:53,008 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-07-11 23:27:53,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:27:53,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952656043] [2022-07-11 23:27:53,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:27:53,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:27:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:27:53,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:27:53,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:27:53,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952656043] [2022-07-11 23:27:53,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952656043] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:27:53,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:27:53,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:27:53,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112485190] [2022-07-11 23:27:53,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:27:53,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 23:27:53,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:27:53,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 23:27:53,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:27:53,133 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 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 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2022-07-11 23:27:53,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:27:53,146 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-07-11 23:27:53,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 23:27:53,149 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2022-07-11 23:27:53,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:27:53,154 INFO L225 Difference]: With dead ends: 40 [2022-07-11 23:27:53,155 INFO L226 Difference]: Without dead ends: 18 [2022-07-11 23:27:53,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:27:53,172 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:27:53,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:27:53,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-11 23:27:53,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-11 23:27:53,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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) [2022-07-11 23:27:53,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-07-11 23:27:53,198 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-07-11 23:27:53,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:27:53,198 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-11 23:27:53,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2022-07-11 23:27:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-07-11 23:27:53,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-11 23:27:53,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:27:53,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:27:53,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:27:53,201 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:27:53,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:27:53,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-07-11 23:27:53,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:27:53,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233353634] [2022-07-11 23:27:53,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:27:53,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:27:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:27:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:27:53,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:27:53,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233353634] [2022-07-11 23:27:53,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233353634] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:27:53,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:27:53,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:27:53,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286248855] [2022-07-11 23:27:53,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:27:53,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:27:53,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:27:53,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:27:53,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:27:53,290 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-07-11 23:27:53,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:27:53,356 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-07-11 23:27:53,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:27:53,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-07-11 23:27:53,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:27:53,358 INFO L225 Difference]: With dead ends: 36 [2022-07-11 23:27:53,359 INFO L226 Difference]: Without dead ends: 25 [2022-07-11 23:27:53,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:27:53,362 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:27:53,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 11 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:27:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-11 23:27:53,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-07-11 23:27:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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) [2022-07-11 23:27:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-07-11 23:27:53,366 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-07-11 23:27:53,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:27:53,366 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-07-11 23:27:53,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-07-11 23:27:53,366 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-07-11 23:27:53,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-11 23:27:53,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:27:53,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:27:53,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:27:53,367 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:27:53,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:27:53,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-07-11 23:27:53,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:27:53,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121907725] [2022-07-11 23:27:53,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:27:53,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:27:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:27:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:27:53,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:27:53,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121907725] [2022-07-11 23:27:53,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121907725] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:27:53,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241133164] [2022-07-11 23:27:53,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:27:53,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:27:53,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:27:53,905 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) [2022-07-11 23:27:53,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-11 23:27:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:27:53,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-11 23:27:53,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:27:54,030 INFO L390 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 [2022-07-11 23:27:54,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-07-11 23:27:54,084 INFO L390 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 16 [2022-07-11 23:27:54,200 INFO L390 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 23 [2022-07-11 23:27:54,266 INFO L390 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 38 treesize of output 25 [2022-07-11 23:27:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:27:54,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:27:54,513 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:27:54,513 INFO L390 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 28 [2022-07-11 23:27:54,555 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:27:54,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-11 23:27:54,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:27:54,561 INFO L390 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 22 treesize of output 14 [2022-07-11 23:27:54,579 INFO L390 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 16 treesize of output 12 [2022-07-11 23:27:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:27:54,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241133164] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:27:54,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:27:54,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 27 [2022-07-11 23:27:54,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174355535] [2022-07-11 23:27:54,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:27:54,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-11 23:27:54,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:27:54,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-11 23:27:54,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2022-07-11 23:27:54,590 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 27 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 states have internal predecessors, (46), 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) [2022-07-11 23:27:54,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:27:54,928 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-07-11 23:27:54,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-11 23:27:54,930 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 states have internal predecessors, (46), 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 20 [2022-07-11 23:27:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:27:54,931 INFO L225 Difference]: With dead ends: 46 [2022-07-11 23:27:54,931 INFO L226 Difference]: Without dead ends: 41 [2022-07-11 23:27:54,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=217, Invalid=905, Unknown=0, NotChecked=0, Total=1122 [2022-07-11 23:27:54,932 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:27:54,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 68 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 179 Invalid, 0 Unknown, 51 Unchecked, 0.1s Time] [2022-07-11 23:27:54,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-11 23:27:54,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-07-11 23:27:54,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 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) [2022-07-11 23:27:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-07-11 23:27:54,943 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 20 [2022-07-11 23:27:54,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:27:54,944 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-07-11 23:27:54,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 states have internal predecessors, (46), 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) [2022-07-11 23:27:54,944 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-07-11 23:27:54,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-11 23:27:54,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:27:54,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:27:54,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-11 23:27:55,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:27:55,163 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:27:55,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:27:55,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-07-11 23:27:55,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:27:55,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982982351] [2022-07-11 23:27:55,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:27:55,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:27:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:27:55,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:27:55,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:27:55,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982982351] [2022-07-11 23:27:55,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982982351] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:27:55,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674307373] [2022-07-11 23:27:55,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:27:55,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:27:55,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:27:55,263 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) [2022-07-11 23:27:55,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-11 23:27:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:27:55,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-11 23:27:55,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:27:55,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-11 23:27:55,372 INFO L390 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 [2022-07-11 23:27:55,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:27:55,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:27:55,400 INFO L390 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 14 treesize of output 12 [2022-07-11 23:27:55,402 INFO L390 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 20 [2022-07-11 23:27:55,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:27:55,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674307373] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:27:55,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:27:55,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-11 23:27:55,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584358007] [2022-07-11 23:27:55,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:27:55,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-11 23:27:55,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:27:55,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-11 23:27:55,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:27:55,412 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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) [2022-07-11 23:27:55,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:27:55,485 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-07-11 23:27:55,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:27:55,486 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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) Word has length 20 [2022-07-11 23:27:55,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:27:55,487 INFO L225 Difference]: With dead ends: 49 [2022-07-11 23:27:55,487 INFO L226 Difference]: Without dead ends: 38 [2022-07-11 23:27:55,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:27:55,488 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:27:55,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 56 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:27:55,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-11 23:27:55,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-07-11 23:27:55,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 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) [2022-07-11 23:27:55,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-07-11 23:27:55,503 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 20 [2022-07-11 23:27:55,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:27:55,504 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-07-11 23:27:55,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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) [2022-07-11 23:27:55,504 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-07-11 23:27:55,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-11 23:27:55,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:27:55,506 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:27:55,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-11 23:27:55,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-11 23:27:55,712 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:27:55,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:27:55,712 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-07-11 23:27:55,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:27:55,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105307312] [2022-07-11 23:27:55,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:27:55,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:27:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:27:55,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:27:55,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:27:55,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105307312] [2022-07-11 23:27:55,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105307312] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:27:55,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649883860] [2022-07-11 23:27:55,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:27:55,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:27:55,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:27:55,764 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) [2022-07-11 23:27:55,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-11 23:27:55,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:27:55,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:27:55,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:27:55,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:27:55,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:27:55,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:27:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:27:55,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649883860] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:27:55,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:27:55,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-11 23:27:55,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779643843] [2022-07-11 23:27:55,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:27:55,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:27:55,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:27:55,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:27:55,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:27:55,886 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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) [2022-07-11 23:27:55,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:27:55,986 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-07-11 23:27:55,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:27:55,987 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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 [2022-07-11 23:27:55,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:27:55,987 INFO L225 Difference]: With dead ends: 70 [2022-07-11 23:27:55,988 INFO L226 Difference]: Without dead ends: 44 [2022-07-11 23:27:55,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-11 23:27:55,988 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 54 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:27:55,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 31 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:27:55,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-11 23:27:55,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-07-11 23:27:55,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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) [2022-07-11 23:27:55,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-07-11 23:27:55,992 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-07-11 23:27:55,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:27:55,992 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-07-11 23:27:55,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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) [2022-07-11 23:27:55,992 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-07-11 23:27:55,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-11 23:27:55,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:27:55,993 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:27:56,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-11 23:27:56,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:27:56,212 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:27:56,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:27:56,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-07-11 23:27:56,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:27:56,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391231967] [2022-07-11 23:27:56,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:27:56,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:27:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:27:56,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:27:56,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:27:56,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391231967] [2022-07-11 23:27:56,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391231967] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:27:56,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385027203] [2022-07-11 23:27:56,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:27:56,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:27:56,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:27:56,268 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) [2022-07-11 23:27:56,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-11 23:27:56,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-11 23:27:56,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:27:56,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:27:56,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:27:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:27:56,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:27:56,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:27:56,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385027203] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:27:56,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:27:56,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-11 23:27:56,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101512119] [2022-07-11 23:27:56,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:27:56,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:27:56,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:27:56,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:27:56,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:27:56,374 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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) [2022-07-11 23:27:56,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:27:56,453 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-07-11 23:27:56,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:27:56,453 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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 [2022-07-11 23:27:56,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:27:56,453 INFO L225 Difference]: With dead ends: 39 [2022-07-11 23:27:56,453 INFO L226 Difference]: Without dead ends: 31 [2022-07-11 23:27:56,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-11 23:27:56,454 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 38 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:27:56,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 30 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:27:56,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-11 23:27:56,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-07-11 23:27:56,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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) [2022-07-11 23:27:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-07-11 23:27:56,460 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2022-07-11 23:27:56,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:27:56,460 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-07-11 23:27:56,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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) [2022-07-11 23:27:56,460 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-07-11 23:27:56,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-11 23:27:56,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:27:56,461 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:27:56,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-11 23:27:56,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:27:56,670 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:27:56,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:27:56,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-07-11 23:27:56,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:27:56,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092655783] [2022-07-11 23:27:56,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:27:56,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:27:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:27:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:27:57,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:27:57,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092655783] [2022-07-11 23:27:57,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092655783] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:27:57,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172369732] [2022-07-11 23:27:57,216 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:27:57,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:27:57,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:27:57,217 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) [2022-07-11 23:27:57,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-11 23:27:57,256 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:27:57,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:27:57,257 WARN L261 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-11 23:27:57,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:27:57,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:27:57,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:27:57,297 INFO L390 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 16 [2022-07-11 23:27:57,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:27:57,325 INFO L390 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 16 [2022-07-11 23:27:57,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:27:57,505 INFO L390 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 44 treesize of output 27 [2022-07-11 23:27:57,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:27:57,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:27:57,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2022-07-11 23:27:57,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:27:57,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:27:57,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:27:57,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2022-07-11 23:27:57,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:27:57,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2022-07-11 23:27:57,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:27:57,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 58 treesize of output 34 [2022-07-11 23:27:57,991 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:27:57,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:27:58,676 INFO L356 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-07-11 23:27:58,676 INFO L390 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 73 [2022-07-11 23:27:58,689 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (= (* 2 ~N~0) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_3))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse3))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (= (+ (- 1) .cse0) 1)) (not (= (+ (- 1) (select v_arrayElimArr_3 .cse4)) 1)) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-11 23:27:58,704 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (= (* 2 ~N~0) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_3))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse3))))) (not (= (+ (- 1) .cse0) 1)) (not (= (+ (- 1) (select v_arrayElimArr_3 .cse4)) 1))))) is different from false [2022-07-11 23:27:58,741 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-11 23:27:58,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172369732] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:27:58,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:27:58,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 49 [2022-07-11 23:27:58,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895849226] [2022-07-11 23:27:58,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:27:58,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-11 23:27:58,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:27:58,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-11 23:27:58,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1863, Unknown=2, NotChecked=182, Total=2352 [2022-07-11 23:27:58,743 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 49 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 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) [2022-07-11 23:28:01,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:28:01,910 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2022-07-11 23:28:01,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-07-11 23:28:01,911 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 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 27 [2022-07-11 23:28:01,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:28:01,912 INFO L225 Difference]: With dead ends: 77 [2022-07-11 23:28:01,912 INFO L226 Difference]: Without dead ends: 72 [2022-07-11 23:28:01,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1845 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=842, Invalid=4864, Unknown=2, NotChecked=298, Total=6006 [2022-07-11 23:28:01,915 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 58 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:28:01,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 116 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 679 Invalid, 0 Unknown, 171 Unchecked, 0.6s Time] [2022-07-11 23:28:01,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-11 23:28:01,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 44. [2022-07-11 23:28:01,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 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) [2022-07-11 23:28:01,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-07-11 23:28:01,920 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 27 [2022-07-11 23:28:01,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:28:01,920 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-07-11 23:28:01,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 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) [2022-07-11 23:28:01,921 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-07-11 23:28:01,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-11 23:28:01,921 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:28:01,921 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:28:01,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-11 23:28:02,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:28:02,122 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:28:02,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:28:02,123 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-07-11 23:28:02,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:28:02,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103493397] [2022-07-11 23:28:02,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:28:02,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:28:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:28:02,246 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:28:02,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:28:02,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103493397] [2022-07-11 23:28:02,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103493397] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:28:02,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87496866] [2022-07-11 23:28:02,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:28:02,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:28:02,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:28:02,248 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) [2022-07-11 23:28:02,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-11 23:28:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:28:02,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-11 23:28:02,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:28:02,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-11 23:28:02,346 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:28:02,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-11 23:28:02,366 INFO L390 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 [2022-07-11 23:28:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:28:02,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:28:02,408 INFO L390 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 16 treesize of output 14 [2022-07-11 23:28:02,410 INFO L390 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 28 treesize of output 24 [2022-07-11 23:28:02,420 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:28:02,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87496866] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:28:02,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:28:02,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2022-07-11 23:28:02,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183577346] [2022-07-11 23:28:02,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:28:02,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-11 23:28:02,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:28:02,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-11 23:28:02,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-07-11 23:28:02,422 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 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) [2022-07-11 23:28:02,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:28:02,607 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-07-11 23:28:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-11 23:28:02,608 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 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 27 [2022-07-11 23:28:02,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:28:02,608 INFO L225 Difference]: With dead ends: 63 [2022-07-11 23:28:02,608 INFO L226 Difference]: Without dead ends: 50 [2022-07-11 23:28:02,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2022-07-11 23:28:02,609 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:28:02,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 54 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:28:02,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-11 23:28:02,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2022-07-11 23:28:02,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 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) [2022-07-11 23:28:02,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2022-07-11 23:28:02,614 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 27 [2022-07-11 23:28:02,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:28:02,614 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2022-07-11 23:28:02,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 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) [2022-07-11 23:28:02,614 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2022-07-11 23:28:02,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-11 23:28:02,614 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:28:02,615 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:28:02,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-11 23:28:02,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:28:02,827 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:28:02,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:28:02,828 INFO L85 PathProgramCache]: Analyzing trace with hash -132219249, now seen corresponding path program 5 times [2022-07-11 23:28:02,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:28:02,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253600469] [2022-07-11 23:28:02,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:28:02,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:28:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:28:02,881 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-11 23:28:02,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:28:02,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253600469] [2022-07-11 23:28:02,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253600469] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:28:02,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761228712] [2022-07-11 23:28:02,882 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 23:28:02,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:28:02,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:28:02,883 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) [2022-07-11 23:28:02,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-11 23:28:02,946 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-11 23:28:02,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:28:02,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:28:02,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:28:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-11 23:28:02,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:28:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-11 23:28:03,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761228712] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:28:03,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:28:03,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-11 23:28:03,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541101999] [2022-07-11 23:28:03,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:28:03,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:28:03,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:28:03,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:28:03,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:28:03,032 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 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) [2022-07-11 23:28:03,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:28:03,133 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-07-11 23:28:03,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:28:03,133 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 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 [2022-07-11 23:28:03,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:28:03,134 INFO L225 Difference]: With dead ends: 77 [2022-07-11 23:28:03,134 INFO L226 Difference]: Without dead ends: 43 [2022-07-11 23:28:03,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:28:03,135 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 60 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:28:03,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 35 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:28:03,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-11 23:28:03,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2022-07-11 23:28:03,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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) [2022-07-11 23:28:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-07-11 23:28:03,140 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2022-07-11 23:28:03,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:28:03,140 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-07-11 23:28:03,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 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) [2022-07-11 23:28:03,140 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-07-11 23:28:03,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-11 23:28:03,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:28:03,141 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:28:03,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-11 23:28:03,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:28:03,341 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:28:03,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:28:03,342 INFO L85 PathProgramCache]: Analyzing trace with hash -863925553, now seen corresponding path program 6 times [2022-07-11 23:28:03,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:28:03,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897922596] [2022-07-11 23:28:03,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:28:03,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:28:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:28:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:28:03,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:28:03,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897922596] [2022-07-11 23:28:03,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897922596] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:28:03,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986607860] [2022-07-11 23:28:03,400 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-11 23:28:03,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:28:03,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:28:03,404 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) [2022-07-11 23:28:03,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-11 23:28:03,463 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-11 23:28:03,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:28:03,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:28:03,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:28:03,506 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:28:03,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:28:03,532 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:28:03,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986607860] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:28:03,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:28:03,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-11 23:28:03,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966329004] [2022-07-11 23:28:03,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:28:03,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:28:03,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:28:03,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:28:03,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:28:03,533 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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) [2022-07-11 23:28:03,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:28:03,653 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-07-11 23:28:03,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 23:28:03,653 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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 32 [2022-07-11 23:28:03,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:28:03,654 INFO L225 Difference]: With dead ends: 42 [2022-07-11 23:28:03,654 INFO L226 Difference]: Without dead ends: 38 [2022-07-11 23:28:03,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-11 23:28:03,654 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 62 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:28:03,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 23 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:28:03,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-11 23:28:03,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-07-11 23:28:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 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) [2022-07-11 23:28:03,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-07-11 23:28:03,659 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2022-07-11 23:28:03,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:28:03,659 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-07-11 23:28:03,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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) [2022-07-11 23:28:03,659 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-07-11 23:28:03,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:28:03,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:28:03,660 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:28:03,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-11 23:28:03,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-11 23:28:03,872 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:28:03,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:28:03,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 7 times [2022-07-11 23:28:03,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:28:03,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374398880] [2022-07-11 23:28:03,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:28:03,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:28:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:28:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:28:04,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:28:04,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374398880] [2022-07-11 23:28:04,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374398880] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:28:04,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622132786] [2022-07-11 23:28:04,962 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-11 23:28:04,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:28:04,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:28:04,963 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) [2022-07-11 23:28:04,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-11 23:28:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:28:05,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-11 23:28:05,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:28:05,032 INFO L390 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 [2022-07-11 23:28:05,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-07-11 23:28:05,057 INFO L390 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 16 [2022-07-11 23:28:05,087 INFO L390 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 16 [2022-07-11 23:28:05,119 INFO L390 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 16 [2022-07-11 23:28:05,262 INFO L390 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 44 treesize of output 27 [2022-07-11 23:28:05,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:05,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2022-07-11 23:28:05,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:05,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:05,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:05,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-07-11 23:28:05,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:05,639 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:28:05,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:05,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:05,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2022-07-11 23:28:05,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:05,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:05,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:05,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:28:05,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:05,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 53 [2022-07-11 23:28:05,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2022-07-11 23:28:05,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 37 [2022-07-11 23:28:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:28:05,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:28:07,977 INFO L356 Elim1Store]: treesize reduction 106, result has 21.5 percent of original size [2022-07-11 23:28:07,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 429 treesize of output 149 [2022-07-11 23:28:07,997 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse0) 2)) (not (= (+ (- 1) (select v_arrayElimArr_4 .cse1)) 1)) (not (= (+ (- 1) .cse2) 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (= (* 2 ~N~0) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse5 .cse6)))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-11 23:28:08,028 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= (select v_arrayElimArr_4 .cse0) 2)) (not (= (+ (- 1) (select v_arrayElimArr_4 .cse1)) 1)) (not (= (+ (- 1) .cse2) 1)) (= (* 2 ~N~0) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse5 .cse6))))))))) is different from false [2022-07-11 23:28:08,080 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse0) 2)) (not (= (+ (- 1) (select v_arrayElimArr_4 .cse1)) 1)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= (+ (- 1) .cse2) 1)) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (= (* 2 ~N~0) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse5 .cse6))))))))) is different from false [2022-07-11 23:28:08,110 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-11 23:28:08,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622132786] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:28:08,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:28:08,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 67 [2022-07-11 23:28:08,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116625866] [2022-07-11 23:28:08,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:28:08,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-11 23:28:08,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:28:08,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-11 23:28:08,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=3533, Unknown=3, NotChecked=378, Total=4422 [2022-07-11 23:28:08,113 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 67 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 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) [2022-07-11 23:28:18,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:28:18,756 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2022-07-11 23:28:18,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-11 23:28:18,757 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 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 34 [2022-07-11 23:28:18,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:28:18,757 INFO L225 Difference]: With dead ends: 99 [2022-07-11 23:28:18,757 INFO L226 Difference]: Without dead ends: 81 [2022-07-11 23:28:18,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3573 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=1212, Invalid=9099, Unknown=3, NotChecked=606, Total=10920 [2022-07-11 23:28:18,760 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 83 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:28:18,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 130 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1052 Invalid, 0 Unknown, 128 Unchecked, 1.1s Time] [2022-07-11 23:28:18,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-11 23:28:18,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 55. [2022-07-11 23:28:18,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 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) [2022-07-11 23:28:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-07-11 23:28:18,766 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 34 [2022-07-11 23:28:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:28:18,766 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-07-11 23:28:18,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 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) [2022-07-11 23:28:18,767 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-07-11 23:28:18,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:28:18,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:28:18,767 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:28:18,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-11 23:28:18,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:28:18,968 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:28:18,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:28:18,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2022-07-11 23:28:18,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:28:18,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967980159] [2022-07-11 23:28:18,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:28:18,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:28:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:28:19,087 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:28:19,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:28:19,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967980159] [2022-07-11 23:28:19,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967980159] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:28:19,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470868623] [2022-07-11 23:28:19,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:28:19,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:28:19,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:28:19,089 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) [2022-07-11 23:28:19,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-11 23:28:19,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:28:19,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:28:19,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-11 23:28:19,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:28:19,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-11 23:28:19,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:19,219 INFO L390 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 25 treesize of output 24 [2022-07-11 23:28:19,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:19,244 INFO L390 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 25 treesize of output 24 [2022-07-11 23:28:19,263 INFO L390 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 [2022-07-11 23:28:19,273 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:28:19,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:28:19,327 INFO L390 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 16 treesize of output 14 [2022-07-11 23:28:19,328 INFO L390 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 28 treesize of output 24 [2022-07-11 23:28:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:28:19,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470868623] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:28:19,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:28:19,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2022-07-11 23:28:19,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930157153] [2022-07-11 23:28:19,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:28:19,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-11 23:28:19,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:28:19,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-11 23:28:19,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-07-11 23:28:19,359 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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) [2022-07-11 23:28:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:28:19,649 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-07-11 23:28:19,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-11 23:28:19,649 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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 34 [2022-07-11 23:28:19,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:28:19,650 INFO L225 Difference]: With dead ends: 76 [2022-07-11 23:28:19,650 INFO L226 Difference]: Without dead ends: 61 [2022-07-11 23:28:19,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2022-07-11 23:28:19,651 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:28:19,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 72 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:28:19,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-11 23:28:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2022-07-11 23:28:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 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) [2022-07-11 23:28:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-07-11 23:28:19,659 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 34 [2022-07-11 23:28:19,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:28:19,659 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-07-11 23:28:19,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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) [2022-07-11 23:28:19,659 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-07-11 23:28:19,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-11 23:28:19,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:28:19,659 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:28:19,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-11 23:28:19,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-11 23:28:19,863 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:28:19,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:28:19,864 INFO L85 PathProgramCache]: Analyzing trace with hash 880380819, now seen corresponding path program 8 times [2022-07-11 23:28:19,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:28:19,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799692382] [2022-07-11 23:28:19,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:28:19,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:28:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:28:19,928 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:28:19,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:28:19,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799692382] [2022-07-11 23:28:19,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799692382] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:28:19,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108722042] [2022-07-11 23:28:19,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:28:19,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:28:19,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:28:19,930 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) [2022-07-11 23:28:19,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-11 23:28:20,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:28:20,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:28:20,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:28:20,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:28:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:28:20,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:28:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:28:20,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108722042] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:28:20,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:28:20,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-11 23:28:20,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79452004] [2022-07-11 23:28:20,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:28:20,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-11 23:28:20,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:28:20,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-11 23:28:20,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:28:20,122 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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) [2022-07-11 23:28:20,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:28:20,252 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-07-11 23:28:20,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:28:20,252 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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 [2022-07-11 23:28:20,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:28:20,253 INFO L225 Difference]: With dead ends: 86 [2022-07-11 23:28:20,253 INFO L226 Difference]: Without dead ends: 50 [2022-07-11 23:28:20,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-07-11 23:28:20,253 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 82 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:28:20,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 36 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:28:20,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-11 23:28:20,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2022-07-11 23:28:20,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 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) [2022-07-11 23:28:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-07-11 23:28:20,258 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 36 [2022-07-11 23:28:20,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:28:20,258 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-07-11 23:28:20,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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) [2022-07-11 23:28:20,258 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-07-11 23:28:20,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-11 23:28:20,259 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:28:20,259 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:28:20,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-11 23:28:20,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-11 23:28:20,467 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:28:20,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:28:20,468 INFO L85 PathProgramCache]: Analyzing trace with hash 975408915, now seen corresponding path program 9 times [2022-07-11 23:28:20,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:28:20,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855166227] [2022-07-11 23:28:20,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:28:20,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:28:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:28:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-11 23:28:20,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:28:20,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855166227] [2022-07-11 23:28:20,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855166227] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:28:20,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573519157] [2022-07-11 23:28:20,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:28:20,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:28:20,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:28:20,533 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) [2022-07-11 23:28:20,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-11 23:28:20,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-11 23:28:20,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:28:20,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:28:20,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:28:20,680 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-11 23:28:20,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:28:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-11 23:28:20,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573519157] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:28:20,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:28:20,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-11 23:28:20,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369787086] [2022-07-11 23:28:20,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:28:20,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-11 23:28:20,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:28:20,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-11 23:28:20,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:28:20,713 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 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) [2022-07-11 23:28:20,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:28:20,849 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-07-11 23:28:20,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-11 23:28:20,849 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 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 [2022-07-11 23:28:20,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:28:20,850 INFO L225 Difference]: With dead ends: 49 [2022-07-11 23:28:20,850 INFO L226 Difference]: Without dead ends: 45 [2022-07-11 23:28:20,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-07-11 23:28:20,850 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 56 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:28:20,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 33 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:28:20,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-11 23:28:20,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-07-11 23:28:20,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 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) [2022-07-11 23:28:20,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-07-11 23:28:20,855 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 39 [2022-07-11 23:28:20,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:28:20,855 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-07-11 23:28:20,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 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) [2022-07-11 23:28:20,855 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-07-11 23:28:20,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-11 23:28:20,856 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:28:20,856 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:28:20,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-11 23:28:21,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-11 23:28:21,070 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:28:21,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:28:21,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 10 times [2022-07-11 23:28:21,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:28:21,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859314239] [2022-07-11 23:28:21,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:28:21,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:28:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:28:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:28:22,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:28:22,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859314239] [2022-07-11 23:28:22,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859314239] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:28:22,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143885721] [2022-07-11 23:28:22,604 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:28:22,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:28:22,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:28:22,605 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:28:22,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-11 23:28:22,664 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:28:22,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:28:22,665 WARN L261 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-11 23:28:22,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:28:22,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:28:22,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:22,705 INFO L390 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 16 [2022-07-11 23:28:22,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:22,735 INFO L390 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 16 [2022-07-11 23:28:22,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:22,772 INFO L390 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 16 [2022-07-11 23:28:22,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:22,822 INFO L390 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 16 [2022-07-11 23:28:23,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,011 INFO L390 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 44 treesize of output 27 [2022-07-11 23:28:23,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-07-11 23:28:23,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2022-07-11 23:28:23,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2022-07-11 23:28:23,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:28:23,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2022-07-11 23:28:23,730 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:28:23,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2022-07-11 23:28:23,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:28:23,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:23,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 71 [2022-07-11 23:28:23,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:24,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 63 [2022-07-11 23:28:24,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:28:24,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 40 [2022-07-11 23:28:24,128 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:28:24,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:28:30,698 INFO L356 Elim1Store]: treesize reduction 233, result has 14.3 percent of original size [2022-07-11 23:28:30,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 1159 treesize of output 287 [2022-07-11 23:28:30,729 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse2 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_5 .cse0) 2)) (not (= (+ (- 1) (select v_arrayElimArr_5 .cse1)) 1)) (not (= 2 (select v_arrayElimArr_5 .cse2))) (not (= (+ (- 1) .cse3) 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (= (* 2 ~N~0) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3 .cse8))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-11 23:28:30,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse2 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_5 .cse0) 2)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= (+ (- 1) (select v_arrayElimArr_5 .cse1)) 1)) (not (= 2 (select v_arrayElimArr_5 .cse2))) (not (= (+ (- 1) .cse3) 1)) (= (* 2 ~N~0) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3 .cse8)))))))))) is different from false [2022-07-11 23:28:30,830 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse2 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_5 .cse0) 2)) (not (= (+ (- 1) (select v_arrayElimArr_5 .cse1)) 1)) (not (= 2 (select v_arrayElimArr_5 .cse2))) (not (= (+ (- 1) .cse3) 1)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (= (* 2 ~N~0) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3 .cse8)))))))))) is different from false [2022-07-11 23:28:30,899 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse2 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_5 .cse0) 2)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (= (+ (- 1) (select v_arrayElimArr_5 .cse1)) 1)) (not (= 2 (select v_arrayElimArr_5 .cse2))) (not (= (+ (- 1) .cse3) 1)) (= (* 2 ~N~0) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse4 .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse3 .cse8))))))) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-11 23:28:30,953 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-07-11 23:28:30,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143885721] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:28:30,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:28:30,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 86 [2022-07-11 23:28:30,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538291040] [2022-07-11 23:28:30,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:28:30,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-11 23:28:30,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:28:30,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-11 23:28:30,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=819, Invalid=5835, Unknown=4, NotChecked=652, Total=7310 [2022-07-11 23:28:30,956 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 86 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 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) [2022-07-11 23:29:03,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:29:03,944 INFO L93 Difference]: Finished difference Result 114 states and 130 transitions. [2022-07-11 23:29:03,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-07-11 23:29:03,945 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 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 41 [2022-07-11 23:29:03,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:29:03,945 INFO L225 Difference]: With dead ends: 114 [2022-07-11 23:29:03,946 INFO L226 Difference]: Without dead ends: 94 [2022-07-11 23:29:03,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 120 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4969 ImplicationChecksByTransitivity, 38.3s TimeCoverageRelationStatistics Valid=1531, Invalid=12286, Unknown=5, NotChecked=940, Total=14762 [2022-07-11 23:29:03,948 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 115 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 2267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:29:03,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 162 Invalid, 2267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 1513 Invalid, 0 Unknown, 321 Unchecked, 2.2s Time] [2022-07-11 23:29:03,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-11 23:29:03,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 65. [2022-07-11 23:29:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.140625) internal successors, (73), 64 states have internal predecessors, (73), 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) [2022-07-11 23:29:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-07-11 23:29:03,957 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 41 [2022-07-11 23:29:03,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:29:03,958 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-07-11 23:29:03,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 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) [2022-07-11 23:29:03,958 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-07-11 23:29:03,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-11 23:29:03,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:29:03,958 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:29:03,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-11 23:29:04,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-11 23:29:04,174 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:29:04,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:29:04,175 INFO L85 PathProgramCache]: Analyzing trace with hash 97262195, now seen corresponding path program 3 times [2022-07-11 23:29:04,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:29:04,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45757313] [2022-07-11 23:29:04,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:29:04,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:29:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:04,347 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-11 23:29:04,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:29:04,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45757313] [2022-07-11 23:29:04,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45757313] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:29:04,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923207958] [2022-07-11 23:29:04,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:29:04,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:04,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:29:04,349 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:29:04,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-11 23:29:04,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-11 23:29:04,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:29:04,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-11 23:29:04,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:29:04,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-11 23:29:04,511 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-11 23:29:04,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2022-07-11 23:29:04,600 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-11 23:29:04,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 56 [2022-07-11 23:29:04,663 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-11 23:29:04,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 47 [2022-07-11 23:29:04,740 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:29:04,741 INFO L390 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 36 treesize of output 36 [2022-07-11 23:29:04,884 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 23 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:29:04,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:29:27,695 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 23 proven. 20 refuted. 2 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:29:27,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923207958] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:29:27,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:29:27,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 17] total 47 [2022-07-11 23:29:27,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208534115] [2022-07-11 23:29:27,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:29:27,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-11 23:29:27,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:29:27,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-11 23:29:27,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1742, Unknown=17, NotChecked=0, Total=2162 [2022-07-11 23:29:27,698 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 47 states, 47 states have (on average 1.872340425531915) internal successors, (88), 47 states have internal predecessors, (88), 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) [2022-07-11 23:29:39,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:29:39,545 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-07-11 23:29:39,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-11 23:29:39,545 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.872340425531915) internal successors, (88), 47 states have internal predecessors, (88), 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 41 [2022-07-11 23:29:39,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:29:39,546 INFO L225 Difference]: With dead ends: 92 [2022-07-11 23:29:39,546 INFO L226 Difference]: Without dead ends: 72 [2022-07-11 23:29:39,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=745, Invalid=3389, Unknown=26, NotChecked=0, Total=4160 [2022-07-11 23:29:39,547 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 20 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:29:39,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 59 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 150 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2022-07-11 23:29:39,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-11 23:29:39,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2022-07-11 23:29:39,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 67 states have internal predecessors, (77), 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) [2022-07-11 23:29:39,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-07-11 23:29:39,561 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 41 [2022-07-11 23:29:39,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:29:39,561 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-07-11 23:29:39,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.872340425531915) internal successors, (88), 47 states have internal predecessors, (88), 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) [2022-07-11 23:29:39,561 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-07-11 23:29:39,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 23:29:39,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:29:39,562 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:29:39,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-11 23:29:39,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:39,767 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:29:39,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:29:39,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1027067351, now seen corresponding path program 11 times [2022-07-11 23:29:39,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:29:39,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204366013] [2022-07-11 23:29:39,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:29:39,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:29:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:39,851 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-11 23:29:39,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:29:39,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204366013] [2022-07-11 23:29:39,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204366013] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:29:39,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294060230] [2022-07-11 23:29:39,852 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 23:29:39,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:39,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:29:39,854 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:29:39,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-11 23:29:40,016 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-11 23:29:40,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:29:40,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-11 23:29:40,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:29:40,102 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-11 23:29:40,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:29:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-11 23:29:40,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294060230] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:29:40,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:29:40,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-11 23:29:40,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051503662] [2022-07-11 23:29:40,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:29:40,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-11 23:29:40,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:29:40,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-11 23:29:40,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-11 23:29:40,145 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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) [2022-07-11 23:29:40,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:29:40,311 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2022-07-11 23:29:40,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-11 23:29:40,311 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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 43 [2022-07-11 23:29:40,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:29:40,312 INFO L225 Difference]: With dead ends: 109 [2022-07-11 23:29:40,312 INFO L226 Difference]: Without dead ends: 62 [2022-07-11 23:29:40,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2022-07-11 23:29:40,313 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 111 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:29:40,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 41 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:29:40,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-11 23:29:40,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2022-07-11 23:29:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 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) [2022-07-11 23:29:40,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-07-11 23:29:40,319 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 43 [2022-07-11 23:29:40,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:29:40,319 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-07-11 23:29:40,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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) [2022-07-11 23:29:40,320 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-07-11 23:29:40,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-11 23:29:40,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:29:40,320 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:29:40,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-11 23:29:40,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-11 23:29:40,527 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:29:40,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:29:40,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1824213007, now seen corresponding path program 12 times [2022-07-11 23:29:40,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:29:40,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721872943] [2022-07-11 23:29:40,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:29:40,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:29:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-11 23:29:40,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:29:40,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721872943] [2022-07-11 23:29:40,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721872943] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:29:40,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262024597] [2022-07-11 23:29:40,602 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-11 23:29:40,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:40,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:29:40,603 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:29:40,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-11 23:29:40,713 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-11 23:29:40,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:29:40,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-11 23:29:40,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:29:40,793 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 22 proven. 29 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-11 23:29:40,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:29:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 22 proven. 29 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-11 23:29:40,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262024597] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:29:40,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:29:40,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-11 23:29:40,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2751093] [2022-07-11 23:29:40,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:29:40,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-11 23:29:40,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:29:40,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-11 23:29:40,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-11 23:29:40,831 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 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) [2022-07-11 23:29:41,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:29:41,012 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-07-11 23:29:41,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-11 23:29:41,013 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 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 46 [2022-07-11 23:29:41,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:29:41,013 INFO L225 Difference]: With dead ends: 61 [2022-07-11 23:29:41,013 INFO L226 Difference]: Without dead ends: 57 [2022-07-11 23:29:41,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2022-07-11 23:29:41,014 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 94 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:29:41,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 30 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:29:41,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-11 23:29:41,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2022-07-11 23:29:41,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 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) [2022-07-11 23:29:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-07-11 23:29:41,021 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 46 [2022-07-11 23:29:41,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:29:41,021 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-07-11 23:29:41,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 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) [2022-07-11 23:29:41,021 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-07-11 23:29:41,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-11 23:29:41,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:29:41,021 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:29:41,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-11 23:29:41,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-11 23:29:41,235 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:29:41,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:29:41,236 INFO L85 PathProgramCache]: Analyzing trace with hash 775276721, now seen corresponding path program 13 times [2022-07-11 23:29:41,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:29:41,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465287932] [2022-07-11 23:29:41,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:29:41,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:29:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:29:43,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:29:43,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465287932] [2022-07-11 23:29:43,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465287932] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:29:43,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287014950] [2022-07-11 23:29:43,109 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-11 23:29:43,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:29:43,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:29:43,110 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:29:43,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-11 23:29:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:29:43,182 WARN L261 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 115 conjunts are in the unsatisfiable core [2022-07-11 23:29:43,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:29:43,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:29:43,198 INFO L390 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 [2022-07-11 23:29:43,205 INFO L390 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 16 [2022-07-11 23:29:43,216 INFO L390 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 16 [2022-07-11 23:29:43,234 INFO L390 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 16 [2022-07-11 23:29:43,252 INFO L390 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 16 [2022-07-11 23:29:43,270 INFO L390 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 16 [2022-07-11 23:29:43,457 INFO L390 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 44 treesize of output 27 [2022-07-11 23:29:43,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:43,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2022-07-11 23:29:43,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:43,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:43,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:43,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 53 [2022-07-11 23:29:43,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:43,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:43,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:43,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:43,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:43,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:43,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 63 [2022-07-11 23:29:44,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 73 [2022-07-11 23:29:44,332 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:29:44,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 79 [2022-07-11 23:29:44,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,493 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:29:44,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 78 [2022-07-11 23:29:44,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:29:44,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 77 [2022-07-11 23:29:44,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,827 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:29:44,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:29:44,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 79 [2022-07-11 23:29:44,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2022-07-11 23:29:45,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 43 [2022-07-11 23:29:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:29:45,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:30:06,069 INFO L356 Elim1Store]: treesize reduction 420, result has 10.4 percent of original size [2022-07-11 23:30:06,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 2897 treesize of output 549 [2022-07-11 23:30:06,119 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (not (= (+ (- 1) .cse2) 1)) (not (= 2 (select v_arrayElimArr_6 .cse3))) (= (* 2 ~N~0) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse9 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse2 .cse6 .cse7 .cse8 .cse9)))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (= 2 (select v_arrayElimArr_6 .cse10))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-11 23:30:06,183 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= (+ (- 1) .cse2) 1)) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= 2 (select v_arrayElimArr_6 .cse3))) (= (* 2 ~N~0) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse9 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse2 .cse6 .cse7 .cse8 .cse9)))))))) (not (= 2 (select v_arrayElimArr_6 .cse10)))))) is different from false [2022-07-11 23:30:06,301 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (not (= (+ (- 1) .cse2) 1)) (not (= 2 (select v_arrayElimArr_6 .cse3))) (= (* 2 ~N~0) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse9 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse2 .cse6 .cse7 .cse8 .cse9)))))))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= 2 (select v_arrayElimArr_6 .cse10)))))) is different from false [2022-07-11 23:30:06,435 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (not (= (+ (- 1) .cse2) 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (= 2 (select v_arrayElimArr_6 .cse3))) (= (* 2 ~N~0) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse9 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse2 .cse6 .cse7 .cse8 .cse9)))))))) (not (= 2 (select v_arrayElimArr_6 .cse10))) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-11 23:30:06,551 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_6 .cse0) 2)) (not (= (select v_arrayElimArr_6 .cse1) 2)) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0)) (not (= (+ (- 1) .cse2) 1)) (not (= 2 (select v_arrayElimArr_6 .cse3))) (= (* 2 ~N~0) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse9 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) .cse2 .cse6 .cse7 .cse8 .cse9)))))))) (not (= 2 (select v_arrayElimArr_6 .cse10))) (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))) is different from false [2022-07-11 23:30:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2022-07-11 23:30:06,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287014950] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:30:06,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:30:06,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36, 36] total 99 [2022-07-11 23:30:06,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372387048] [2022-07-11 23:30:06,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:30:06,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2022-07-11 23:30:06,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:30:06,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2022-07-11 23:30:06,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=984, Invalid=7773, Unknown=5, NotChecked=940, Total=9702 [2022-07-11 23:30:06,625 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 99 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 99 states have internal predecessors, (122), 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) [2022-07-11 23:32:15,500 WARN L233 SmtUtils]: Spent 1.31m on a formula simplification. DAG size of input: 270 DAG size of output: 262 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)