./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/prefixsum_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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/verifythis/prefixsum_rec.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 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 17:34:19,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 17:34:19,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 17:34:19,474 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 17:34:19,474 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 17:34:19,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 17:34:19,476 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 17:34:19,478 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 17:34:19,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 17:34:19,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 17:34:19,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 17:34:19,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 17:34:19,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 17:34:19,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 17:34:19,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 17:34:19,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 17:34:19,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 17:34:19,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 17:34:19,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 17:34:19,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 17:34:19,488 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 17:34:19,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 17:34:19,490 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 17:34:19,491 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 17:34:19,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 17:34:19,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 17:34:19,493 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 17:34:19,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 17:34:19,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 17:34:19,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 17:34:19,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 17:34:19,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 17:34:19,496 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 17:34:19,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 17:34:19,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 17:34:19,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 17:34:19,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 17:34:19,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 17:34:19,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 17:34:19,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 17:34:19,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 17:34:19,511 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 17:34:19,512 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 17:34:19,542 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 17:34:19,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 17:34:19,543 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 17:34:19,543 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 17:34:19,544 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 17:34:19,544 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 17:34:19,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 17:34:19,545 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 17:34:19,545 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 17:34:19,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 17:34:19,546 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 17:34:19,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 17:34:19,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 17:34:19,546 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 17:34:19,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 17:34:19,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 17:34:19,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 17:34:19,547 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 17:34:19,547 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 17:34:19,547 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 17:34:19,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 17:34:19,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 17:34:19,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 17:34:19,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 17:34:19,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:34:19,549 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 17:34:19,549 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 17:34:19,549 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 17:34:19,549 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 17:34:19,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 17:34:19,550 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 17:34:19,550 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 17:34:19,550 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 17:34:19,550 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 -> 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab [2022-07-19 17:34:19,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 17:34:19,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 17:34:19,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 17:34:19,791 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 17:34:19,791 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 17:34:19,792 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_rec.c [2022-07-19 17:34:19,837 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dea52606e/0f05d09036f74e30b281483ebf808b19/FLAG8b15efcf7 [2022-07-19 17:34:20,195 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 17:34:20,195 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c [2022-07-19 17:34:20,201 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dea52606e/0f05d09036f74e30b281483ebf808b19/FLAG8b15efcf7 [2022-07-19 17:34:20,215 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dea52606e/0f05d09036f74e30b281483ebf808b19 [2022-07-19 17:34:20,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 17:34:20,218 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 17:34:20,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 17:34:20,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 17:34:20,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 17:34:20,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:34:20" (1/1) ... [2022-07-19 17:34:20,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d888871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:20, skipping insertion in model container [2022-07-19 17:34:20,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:34:20" (1/1) ... [2022-07-19 17:34:20,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 17:34:20,243 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 17:34:20,383 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/verifythis/prefixsum_rec.c[525,538] [2022-07-19 17:34:20,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:34:20,410 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 17:34:20,427 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/verifythis/prefixsum_rec.c[525,538] [2022-07-19 17:34:20,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:34:20,444 INFO L208 MainTranslator]: Completed translation [2022-07-19 17:34:20,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:20 WrapperNode [2022-07-19 17:34:20,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 17:34:20,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 17:34:20,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 17:34:20,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 17:34:20,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:20" (1/1) ... [2022-07-19 17:34:20,456 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:20" (1/1) ... [2022-07-19 17:34:20,469 INFO L137 Inliner]: procedures = 22, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2022-07-19 17:34:20,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 17:34:20,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 17:34:20,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 17:34:20,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 17:34:20,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:20" (1/1) ... [2022-07-19 17:34:20,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:20" (1/1) ... [2022-07-19 17:34:20,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:20" (1/1) ... [2022-07-19 17:34:20,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:20" (1/1) ... [2022-07-19 17:34:20,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:20" (1/1) ... [2022-07-19 17:34:20,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:20" (1/1) ... [2022-07-19 17:34:20,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:20" (1/1) ... [2022-07-19 17:34:20,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 17:34:20,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 17:34:20,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 17:34:20,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 17:34:20,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:20" (1/1) ... [2022-07-19 17:34:20,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:34:20,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:34:20,523 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-19 17:34:20,535 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-19 17:34:20,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 17:34:20,554 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 17:34:20,554 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 17:34:20,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 17:34:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2022-07-19 17:34:20,555 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2022-07-19 17:34:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 17:34:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 17:34:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2022-07-19 17:34:20,555 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2022-07-19 17:34:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 17:34:20,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 17:34:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 17:34:20,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-19 17:34:20,556 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-19 17:34:20,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 17:34:20,646 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 17:34:20,648 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 17:34:23,002 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 17:34:23,007 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 17:34:23,007 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-19 17:34:23,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:34:23 BoogieIcfgContainer [2022-07-19 17:34:23,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 17:34:23,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 17:34:23,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 17:34:23,012 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 17:34:23,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 05:34:20" (1/3) ... [2022-07-19 17:34:23,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7586c220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:34:23, skipping insertion in model container [2022-07-19 17:34:23,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:34:20" (2/3) ... [2022-07-19 17:34:23,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7586c220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:34:23, skipping insertion in model container [2022-07-19 17:34:23,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:34:23" (3/3) ... [2022-07-19 17:34:23,014 INFO L111 eAbstractionObserver]: Analyzing ICFG prefixsum_rec.c [2022-07-19 17:34:23,024 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 17:34:23,024 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 17:34:23,055 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 17:34:23,060 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@54bfa183, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3fd7f0a [2022-07-19 17:34:23,060 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 17:34:23,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 36 states have internal predecessors, (44), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-19 17:34:23,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 17:34:23,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:23,070 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:34:23,070 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:23,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:23,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1639330660, now seen corresponding path program 1 times [2022-07-19 17:34:23,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:23,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882881389] [2022-07-19 17:34:23,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:23,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:23,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:34:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:23,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:34:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:23,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 17:34:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:23,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 17:34:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:23,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 17:34:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:23,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:34:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:23,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 17:34:23,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:23,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882881389] [2022-07-19 17:34:23,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882881389] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:23,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:34:23,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 17:34:23,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740736489] [2022-07-19 17:34:23,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:23,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:34:23,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:23,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:34:23,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 17:34:23,278 INFO L87 Difference]: Start difference. First operand has 49 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 36 states have internal predecessors, (44), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 17:34:23,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:23,335 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2022-07-19 17:34:23,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:34:23,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-07-19 17:34:23,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:23,342 INFO L225 Difference]: With dead ends: 96 [2022-07-19 17:34:23,342 INFO L226 Difference]: Without dead ends: 46 [2022-07-19 17:34:23,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 17:34:23,347 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:23,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:34:23,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-19 17:34:23,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-07-19 17:34:23,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-19 17:34:23,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2022-07-19 17:34:23,374 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 44 [2022-07-19 17:34:23,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:23,375 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2022-07-19 17:34:23,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 17:34:23,375 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-07-19 17:34:23,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 17:34:23,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:23,377 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:34:23,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 17:34:23,378 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:23,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:23,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1439199646, now seen corresponding path program 1 times [2022-07-19 17:34:23,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:23,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627853661] [2022-07-19 17:34:23,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:23,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:23,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:34:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:23,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:34:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:23,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 17:34:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:23,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 17:34:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:23,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 17:34:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:23,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:34:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:23,599 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 17:34:23,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:23,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627853661] [2022-07-19 17:34:23,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627853661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:34:23,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:34:23,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 17:34:23,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982766897] [2022-07-19 17:34:23,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:34:23,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 17:34:23,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:23,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 17:34:23,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:34:23,606 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 17:34:23,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:23,860 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2022-07-19 17:34:23,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 17:34:23,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-07-19 17:34:23,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:23,862 INFO L225 Difference]: With dead ends: 87 [2022-07-19 17:34:23,862 INFO L226 Difference]: Without dead ends: 71 [2022-07-19 17:34:23,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-19 17:34:23,864 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 35 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:23,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 213 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:34:23,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-19 17:34:23,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2022-07-19 17:34:23,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-19 17:34:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2022-07-19 17:34:23,871 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 44 [2022-07-19 17:34:23,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:23,872 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-07-19 17:34:23,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 17:34:23,872 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-07-19 17:34:23,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 17:34:23,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:23,877 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:34:23,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 17:34:23,877 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:23,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:23,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1012024996, now seen corresponding path program 1 times [2022-07-19 17:34:23,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:23,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773995029] [2022-07-19 17:34:23,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:23,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:23,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:34:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:23,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:34:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:23,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 17:34:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:23,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 17:34:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:24,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 17:34:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:24,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:34:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:24,008 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 17:34:24,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:24,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773995029] [2022-07-19 17:34:24,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773995029] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:34:24,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173095719] [2022-07-19 17:34:24,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:24,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:24,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:34:24,011 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-19 17:34:24,012 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-19 17:34:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:24,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 17:34:24,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:34:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 17:34:24,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:34:24,332 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 17:34:24,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173095719] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:34:24,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:34:24,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-07-19 17:34:24,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583372649] [2022-07-19 17:34:24,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:34:24,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 17:34:24,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:24,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 17:34:24,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:34:24,335 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-19 17:34:24,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:24,524 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2022-07-19 17:34:24,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 17:34:24,524 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 46 [2022-07-19 17:34:24,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:24,531 INFO L225 Difference]: With dead ends: 73 [2022-07-19 17:34:24,532 INFO L226 Difference]: Without dead ends: 50 [2022-07-19 17:34:24,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-07-19 17:34:24,533 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 34 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:24,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 254 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:34:24,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-19 17:34:24,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-07-19 17:34:24,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-19 17:34:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2022-07-19 17:34:24,538 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 46 [2022-07-19 17:34:24,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:24,538 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2022-07-19 17:34:24,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 12 states have internal predecessors, (57), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-19 17:34:24,538 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-07-19 17:34:24,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 17:34:24,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:24,539 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:34:24,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 17:34:24,756 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-19 17:34:24,757 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:24,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:24,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1298139546, now seen corresponding path program 2 times [2022-07-19 17:34:24,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:24,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041935113] [2022-07-19 17:34:24,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:24,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:24,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:34:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:24,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:34:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:24,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 17:34:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:24,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 17:34:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:24,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 17:34:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:24,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 17:34:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 17:34:24,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:24,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041935113] [2022-07-19 17:34:24,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041935113] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:34:24,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958735550] [2022-07-19 17:34:24,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 17:34:24,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:24,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:34:24,954 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-19 17:34:24,955 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-19 17:34:25,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 17:34:25,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:34:25,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-19 17:34:25,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:34:25,077 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 16 treesize of output 12 [2022-07-19 17:34:27,516 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-07-19 17:34:27,516 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 2 case distinctions, treesize of input 45 treesize of output 27 [2022-07-19 17:34:27,662 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-19 17:34:27,662 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 23 [2022-07-19 17:34:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 17:34:27,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:34:27,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958735550] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:34:27,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 17:34:27,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 [2022-07-19 17:34:27,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327713889] [2022-07-19 17:34:27,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 17:34:27,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 17:34:27,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:34:27,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 17:34:27,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=408, Unknown=1, NotChecked=0, Total=462 [2022-07-19 17:34:27,930 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-19 17:34:29,971 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 17:34:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:34:30,755 INFO L93 Difference]: Finished difference Result 99 states and 127 transitions. [2022-07-19 17:34:30,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-19 17:34:30,757 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 48 [2022-07-19 17:34:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:34:30,758 INFO L225 Difference]: With dead ends: 99 [2022-07-19 17:34:30,758 INFO L226 Difference]: Without dead ends: 76 [2022-07-19 17:34:30,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=187, Invalid=1002, Unknown=1, NotChecked=0, Total=1190 [2022-07-19 17:34:30,760 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 38 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-19 17:34:30,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 377 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 363 Invalid, 1 Unknown, 149 Unchecked, 2.4s Time] [2022-07-19 17:34:30,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-19 17:34:30,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2022-07-19 17:34:30,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 46 states have internal predecessors, (51), 13 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2022-07-19 17:34:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2022-07-19 17:34:30,768 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 48 [2022-07-19 17:34:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:34:30,768 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2022-07-19 17:34:30,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-19 17:34:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2022-07-19 17:34:30,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-19 17:34:30,769 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:34:30,769 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:34:30,788 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-19 17:34:30,975 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-19 17:34:30,976 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:34:30,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:34:30,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1879560803, now seen corresponding path program 1 times [2022-07-19 17:34:30,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:34:30,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442975619] [2022-07-19 17:34:30,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:30,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:34:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:31,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:34:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:31,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 17:34:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:32,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 17:34:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:32,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:34:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:32,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 17:34:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:32,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:34:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 17:34:32,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:34:32,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442975619] [2022-07-19 17:34:32,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442975619] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:34:32,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761705957] [2022-07-19 17:34:32,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:34:32,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:34:32,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:34:32,398 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-19 17:34:32,399 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-19 17:34:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:34:32,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-19 17:34:32,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:34:32,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 17:34:32,536 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 7 treesize of output 6 [2022-07-19 17:34:32,634 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 17:34:32,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-19 17:34:32,715 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 15 treesize of output 10 [2022-07-19 17:34:32,800 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 36 treesize of output 32 [2022-07-19 17:34:32,883 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 28 treesize of output 26 [2022-07-19 17:34:37,863 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 51 treesize of output 45 [2022-07-19 17:34:39,755 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 34 treesize of output 32 [2022-07-19 17:34:40,976 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_181 Int)) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 v_ArrVal_181))) |c_#memory_int|)) is different from true [2022-07-19 17:34:40,993 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 66 treesize of output 60 [2022-07-19 17:34:46,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 80 [2022-07-19 17:34:47,058 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 17:34:47,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:35:01,720 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_check_~a0#1.offset_6| Int)) (or (let ((.cse0 (< |c_ULTIMATE.start_main_~n~0#1| 0)) (.cse1 (= (mod |c_ULTIMATE.start_main_~n~0#1| 2) 0))) (and (or (and .cse0 (not .cse1)) (forall ((v_ArrVal_188 Int)) (let ((.cse2 (let ((.cse5 (+ (- 4) |c_ULTIMATE.start_main_~a~0#1.offset| (* (div |c_ULTIMATE.start_main_~n~0#1| 2) 4)))) (store (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (+ (- 4) (* |c_ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse3 .cse4 (+ (select .cse3 .cse5) (select .cse3 .cse4)))) .cse5 v_ArrVal_188)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~a0~0#1.base|) |v_ULTIMATE.start_check_~a0#1.offset_6|) (select .cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) (or (not .cse0) (forall ((v_ArrVal_188 Int)) (let ((.cse6 (let ((.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* (div |c_ULTIMATE.start_main_~n~0#1| 2) 4)))) (store (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (+ (- 4) (* |c_ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse7 .cse8 (+ (select .cse7 .cse9) (select .cse7 .cse8)))) .cse9 v_ArrVal_188)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~a0~0#1.base|) |v_ULTIMATE.start_check_~a0#1.offset_6|) (select .cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) .cse1))) (< |c_ULTIMATE.start_main_~a0~0#1.offset| |v_ULTIMATE.start_check_~a0#1.offset_6|))) is different from false [2022-07-19 17:35:01,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761705957] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:01,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 17:35:01,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 44 [2022-07-19 17:35:01,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35198217] [2022-07-19 17:35:01,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 17:35:01,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-19 17:35:01,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:01,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-19 17:35:01,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2004, Unknown=14, NotChecked=182, Total=2352 [2022-07-19 17:35:01,726 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 44 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 35 states have internal predecessors, (63), 7 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-19 17:35:30,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:30,553 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2022-07-19 17:35:30,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-19 17:35:30,553 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 35 states have internal predecessors, (63), 7 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) Word has length 53 [2022-07-19 17:35:30,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:30,554 INFO L225 Difference]: With dead ends: 91 [2022-07-19 17:35:30,554 INFO L226 Difference]: Without dead ends: 89 [2022-07-19 17:35:30,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 43 SyntacticMatches, 8 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 57.6s TimeCoverageRelationStatistics Valid=327, Invalid=3686, Unknown=27, NotChecked=250, Total=4290 [2022-07-19 17:35:30,556 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 29 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 259 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:30,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 491 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 478 Invalid, 0 Unknown, 259 Unchecked, 0.5s Time] [2022-07-19 17:35:30,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-19 17:35:30,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2022-07-19 17:35:30,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 61 states have internal predecessors, (67), 15 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (23), 16 states have call predecessors, (23), 15 states have call successors, (23) [2022-07-19 17:35:30,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2022-07-19 17:35:30,565 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 53 [2022-07-19 17:35:30,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:30,565 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2022-07-19 17:35:30,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 35 states have internal predecessors, (63), 7 states have call successors, (10), 3 states have call predecessors, (10), 8 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-19 17:35:30,566 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2022-07-19 17:35:30,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-19 17:35:30,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:30,567 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:30,594 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-19 17:35:30,771 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-19 17:35:30,773 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:30,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:30,773 INFO L85 PathProgramCache]: Analyzing trace with hash -362686961, now seen corresponding path program 1 times [2022-07-19 17:35:30,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:30,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309883398] [2022-07-19 17:35:30,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:30,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:30,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:35:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:30,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:35:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:30,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 17:35:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:30,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 17:35:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:30,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 17:35:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:30,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 17:35:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:30,883 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 17:35:30,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:30,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309883398] [2022-07-19 17:35:30,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309883398] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:30,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763257941] [2022-07-19 17:35:30,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:30,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:30,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:30,885 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-19 17:35:30,886 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-19 17:35:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:30,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 17:35:30,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 17:35:31,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:35:31,154 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 17:35:31,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763257941] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:35:31,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:35:31,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 14 [2022-07-19 17:35:31,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463173544] [2022-07-19 17:35:31,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:35:31,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 17:35:31,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:31,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 17:35:31,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-19 17:35:31,156 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-19 17:35:31,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:31,350 INFO L93 Difference]: Finished difference Result 115 states and 144 transitions. [2022-07-19 17:35:31,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 17:35:31,350 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 54 [2022-07-19 17:35:31,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:31,351 INFO L225 Difference]: With dead ends: 115 [2022-07-19 17:35:31,351 INFO L226 Difference]: Without dead ends: 95 [2022-07-19 17:35:31,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-07-19 17:35:31,352 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 35 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:31,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 243 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:35:31,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-19 17:35:31,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2022-07-19 17:35:31,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 61 states have internal predecessors, (67), 15 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) [2022-07-19 17:35:31,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 104 transitions. [2022-07-19 17:35:31,365 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 104 transitions. Word has length 54 [2022-07-19 17:35:31,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:31,366 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 104 transitions. [2022-07-19 17:35:31,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-19 17:35:31,366 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 104 transitions. [2022-07-19 17:35:31,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 17:35:31,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:31,367 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:31,384 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-19 17:35:31,583 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-19 17:35:31,584 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:31,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:31,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1333958502, now seen corresponding path program 2 times [2022-07-19 17:35:31,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:31,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885998520] [2022-07-19 17:35:31,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:31,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:31,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:35:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:31,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 17:35:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:31,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 17:35:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:31,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:35:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:31,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 17:35:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:31,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:35:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:31,688 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 17:35:31,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:31,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885998520] [2022-07-19 17:35:31,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885998520] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:31,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710189003] [2022-07-19 17:35:31,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 17:35:31,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:31,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:31,690 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-19 17:35:31,691 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-19 17:35:31,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 17:35:31,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:35:31,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 17:35:31,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:31,875 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-19 17:35:31,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:35:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-19 17:35:31,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710189003] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:35:31,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:35:31,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 16 [2022-07-19 17:35:31,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784473216] [2022-07-19 17:35:31,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:35:31,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 17:35:31,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:31,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 17:35:31,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-07-19 17:35:31,943 INFO L87 Difference]: Start difference. First operand 83 states and 104 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 17:35:33,988 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 17:35:36,104 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 17:35:38,226 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 17:35:40,351 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 17:35:40,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:40,737 INFO L93 Difference]: Finished difference Result 127 states and 154 transitions. [2022-07-19 17:35:40,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 17:35:40,738 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 57 [2022-07-19 17:35:40,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:40,739 INFO L225 Difference]: With dead ends: 127 [2022-07-19 17:35:40,739 INFO L226 Difference]: Without dead ends: 111 [2022-07-19 17:35:40,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2022-07-19 17:35:40,740 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 66 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 23 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:40,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 421 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 332 Invalid, 4 Unknown, 0 Unchecked, 8.7s Time] [2022-07-19 17:35:40,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-19 17:35:40,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2022-07-19 17:35:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.121212121212121) internal successors, (74), 66 states have internal predecessors, (74), 16 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (23), 18 states have call predecessors, (23), 16 states have call successors, (23) [2022-07-19 17:35:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2022-07-19 17:35:40,751 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 57 [2022-07-19 17:35:40,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:40,751 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2022-07-19 17:35:40,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 17:35:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2022-07-19 17:35:40,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-19 17:35:40,752 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:40,752 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:40,771 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-19 17:35:40,968 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-19 17:35:40,969 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:40,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:40,969 INFO L85 PathProgramCache]: Analyzing trace with hash 33191180, now seen corresponding path program 1 times [2022-07-19 17:35:40,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:40,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021096818] [2022-07-19 17:35:40,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:40,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:41,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:35:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:41,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 17:35:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:41,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 17:35:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:41,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:35:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:41,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 17:35:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:41,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:35:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:41,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:35:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:41,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 17:35:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:41,093 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-19 17:35:41,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:41,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021096818] [2022-07-19 17:35:41,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021096818] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:41,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339488271] [2022-07-19 17:35:41,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:41,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:41,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:41,096 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-19 17:35:41,138 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-19 17:35:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:41,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 17:35:41,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-19 17:35:41,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:35:41,671 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-19 17:35:41,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339488271] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:35:41,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:35:41,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 20 [2022-07-19 17:35:41,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041541386] [2022-07-19 17:35:41,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:35:41,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-19 17:35:41,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:41,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-19 17:35:41,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-07-19 17:35:41,673 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-19 17:35:42,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:42,162 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2022-07-19 17:35:42,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 17:35:42,163 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 59 [2022-07-19 17:35:42,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:42,165 INFO L225 Difference]: With dead ends: 106 [2022-07-19 17:35:42,165 INFO L226 Difference]: Without dead ends: 95 [2022-07-19 17:35:42,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2022-07-19 17:35:42,166 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 84 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:42,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 298 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 17:35:42,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-19 17:35:42,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2022-07-19 17:35:42,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.121212121212121) internal successors, (74), 67 states have internal predecessors, (74), 17 states have call successors, (17), 6 states have call predecessors, (17), 8 states have return successors, (24), 18 states have call predecessors, (24), 17 states have call successors, (24) [2022-07-19 17:35:42,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2022-07-19 17:35:42,191 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 59 [2022-07-19 17:35:42,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:42,191 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2022-07-19 17:35:42,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-19 17:35:42,191 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2022-07-19 17:35:42,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 17:35:42,196 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:42,196 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:42,213 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-19 17:35:42,405 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-19 17:35:42,406 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:42,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:42,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1099509749, now seen corresponding path program 1 times [2022-07-19 17:35:42,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:42,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494523780] [2022-07-19 17:35:42,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:42,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:42,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:35:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:42,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 17:35:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:42,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 17:35:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:42,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:35:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:42,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 17:35:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:42,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:35:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:42,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 17:35:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:42,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 17:35:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:42,510 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 17:35:42,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:42,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494523780] [2022-07-19 17:35:42,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494523780] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:42,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513661415] [2022-07-19 17:35:42,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:42,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:42,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:42,512 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-19 17:35:42,513 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-19 17:35:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:42,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 17:35:42,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:42,673 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 17:35:42,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:35:43,009 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 17:35:43,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513661415] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:35:43,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:35:43,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-07-19 17:35:43,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526316884] [2022-07-19 17:35:43,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:35:43,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-19 17:35:43,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:43,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-19 17:35:43,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-07-19 17:35:43,011 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 7 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-19 17:35:43,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:43,158 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-07-19 17:35:43,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 17:35:43,158 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 7 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) Word has length 65 [2022-07-19 17:35:43,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:43,161 INFO L225 Difference]: With dead ends: 103 [2022-07-19 17:35:43,161 INFO L226 Difference]: Without dead ends: 76 [2022-07-19 17:35:43,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-07-19 17:35:43,165 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 28 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:43,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 202 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:35:43,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-19 17:35:43,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2022-07-19 17:35:43,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2022-07-19 17:35:43,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-07-19 17:35:43,175 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 65 [2022-07-19 17:35:43,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:43,175 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-07-19 17:35:43,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 7 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (15), 5 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-19 17:35:43,175 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-07-19 17:35:43,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-19 17:35:43,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:43,177 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:43,209 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-19 17:35:43,391 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-19 17:35:43,392 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:43,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:43,392 INFO L85 PathProgramCache]: Analyzing trace with hash -838921823, now seen corresponding path program 1 times [2022-07-19 17:35:43,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:43,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826902764] [2022-07-19 17:35:43,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:43,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:43,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:35:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:43,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:35:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:43,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 17:35:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:43,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 17:35:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:43,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 17:35:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:43,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:35:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:43,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 17:35:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:43,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:35:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:43,488 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 17:35:43,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:43,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826902764] [2022-07-19 17:35:43,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826902764] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:43,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139690166] [2022-07-19 17:35:43,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:43,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:43,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:43,490 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-19 17:35:43,516 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-19 17:35:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:43,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 17:35:43,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 17:35:43,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:35:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 17:35:43,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139690166] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:35:43,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:35:43,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-07-19 17:35:43,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136472158] [2022-07-19 17:35:43,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:35:43,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 17:35:43,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:35:43,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 17:35:43,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:35:43,784 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 17:35:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:35:43,940 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-07-19 17:35:43,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 17:35:43,940 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2022-07-19 17:35:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:35:43,941 INFO L225 Difference]: With dead ends: 67 [2022-07-19 17:35:43,941 INFO L226 Difference]: Without dead ends: 58 [2022-07-19 17:35:43,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-07-19 17:35:43,941 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 40 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:35:43,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 224 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:35:43,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-19 17:35:43,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-07-19 17:35:43,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-19 17:35:43,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2022-07-19 17:35:43,946 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 66 [2022-07-19 17:35:43,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:35:43,946 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2022-07-19 17:35:43,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-19 17:35:43,946 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-07-19 17:35:43,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 17:35:43,946 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:35:43,946 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:35:43,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-19 17:35:44,155 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-19 17:35:44,155 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:35:44,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:35:44,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1124650442, now seen corresponding path program 1 times [2022-07-19 17:35:44,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:35:44,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518174138] [2022-07-19 17:35:44,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:44,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:35:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:44,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:35:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:44,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:35:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:44,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 17:35:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:44,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 17:35:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:44,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 17:35:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:44,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:35:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:44,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 17:35:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:44,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:35:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:44,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:35:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:44,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 17:35:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:44,404 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 17:35:44,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:35:44,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518174138] [2022-07-19 17:35:44,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518174138] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:35:44,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036107212] [2022-07-19 17:35:44,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:35:44,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:35:44,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:35:44,405 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-19 17:35:44,406 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-19 17:35:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:35:44,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 170 conjunts are in the unsatisfiable core [2022-07-19 17:35:44,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:35:44,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 17:35:44,550 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 7 treesize of output 6 [2022-07-19 17:35:44,613 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 17:35:44,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-19 17:35:44,643 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_545 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_545) |c_#memory_int|)) is different from true [2022-07-19 17:35:44,652 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 13 treesize of output 15 [2022-07-19 17:35:44,688 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 13 treesize of output 15 [2022-07-19 17:35:44,723 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 13 treesize of output 15 [2022-07-19 17:35:44,762 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 13 treesize of output 15 [2022-07-19 17:35:49,132 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_552 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_552)))) is different from true [2022-07-19 17:36:01,789 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 0 case distinctions, treesize of input 37 treesize of output 32 [2022-07-19 17:36:01,891 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 0 case distinctions, treesize of input 45 treesize of output 40 [2022-07-19 17:36:06,317 WARN L855 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_561 Int)) (and (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 v_ArrVal_561))) |c_#memory_int|) (<= downsweep_~left |c_downsweep_#in~left|))) is different from true [2022-07-19 17:36:11,462 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_564 Int) (v_ArrVal_563 Int) (downsweep_~left Int) (downsweep_~right Int) (downsweep_~a.offset Int)) (and (<= |c_downsweep_#in~right| downsweep_~right) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ downsweep_~a.offset (* downsweep_~right 4)) v_ArrVal_564) (+ downsweep_~a.offset (* downsweep_~left 4)) v_ArrVal_563)) |c_#memory_int|) (<= |c_downsweep_#in~left| downsweep_~left) (<= |c_downsweep_#in~a.offset| downsweep_~a.offset))) is different from true [2022-07-19 17:36:15,906 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 0 case distinctions, treesize of input 154 treesize of output 143 [2022-07-19 17:36:24,838 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 139 treesize of output 133 [2022-07-19 17:36:24,917 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 15 not checked. [2022-07-19 17:36:24,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:36:28,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036107212] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:36:28,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 17:36:28,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 36] total 47 [2022-07-19 17:36:28,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710965338] [2022-07-19 17:36:28,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 17:36:28,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-19 17:36:28,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:36:28,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-19 17:36:28,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1927, Unknown=19, NotChecked=364, Total=2450 [2022-07-19 17:36:28,306 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 47 states, 39 states have (on average 2.076923076923077) internal successors, (81), 39 states have internal predecessors, (81), 12 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2022-07-19 17:36:30,442 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 17:36:45,378 WARN L233 SmtUtils]: Spent 5.70s on a formula simplification. DAG size of input: 53 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 17:36:46,640 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_564 Int) (v_ArrVal_563 Int) (downsweep_~left Int) (downsweep_~right Int) (downsweep_~a.offset Int)) (and (<= |c_downsweep_#in~right| downsweep_~right) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ downsweep_~a.offset (* downsweep_~right 4)) v_ArrVal_564) (+ downsweep_~a.offset (* downsweep_~left 4)) v_ArrVal_563)) |c_#memory_int|) (<= |c_downsweep_#in~left| downsweep_~left) (<= |c_downsweep_#in~a.offset| downsweep_~a.offset))) (exists ((downsweep_~left Int) (v_ArrVal_561 Int)) (and (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)))) (store (let ((.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4))) (.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (select .cse0 .cse2)))) .cse2 v_ArrVal_561))) |c_#memory_int|) (<= downsweep_~left |c_downsweep_#in~left|)))) is different from true [2022-07-19 17:36:46,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:36:46,662 INFO L93 Difference]: Finished difference Result 125 states and 168 transitions. [2022-07-19 17:36:46,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-19 17:36:46,663 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 39 states have (on average 2.076923076923077) internal successors, (81), 39 states have internal predecessors, (81), 12 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) Word has length 72 [2022-07-19 17:36:46,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:36:46,664 INFO L225 Difference]: With dead ends: 125 [2022-07-19 17:36:46,664 INFO L226 Difference]: Without dead ends: 97 [2022-07-19 17:36:46,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 57.6s TimeCoverageRelationStatistics Valid=394, Invalid=5149, Unknown=27, NotChecked=750, Total=6320 [2022-07-19 17:36:46,665 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 34 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1016 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-19 17:36:46,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 470 Invalid, 1907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 828 Invalid, 1 Unknown, 1016 Unchecked, 2.6s Time] [2022-07-19 17:36:46,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-19 17:36:46,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2022-07-19 17:36:46,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 64 states have internal predecessors, (69), 17 states have call successors, (17), 5 states have call predecessors, (17), 9 states have return successors, (33), 19 states have call predecessors, (33), 17 states have call successors, (33) [2022-07-19 17:36:46,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2022-07-19 17:36:46,675 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 72 [2022-07-19 17:36:46,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:36:46,675 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2022-07-19 17:36:46,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 39 states have (on average 2.076923076923077) internal successors, (81), 39 states have internal predecessors, (81), 12 states have call successors, (19), 3 states have call predecessors, (19), 10 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2022-07-19 17:36:46,675 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2022-07-19 17:36:46,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-19 17:36:46,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:36:46,676 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:36:46,693 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-19 17:36:46,883 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-19 17:36:46,884 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:36:46,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:36:46,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1763257480, now seen corresponding path program 2 times [2022-07-19 17:36:46,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:36:46,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410080329] [2022-07-19 17:36:46,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:36:46,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:36:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:36:47,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:36:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:36:47,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 17:36:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:36:47,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 17:36:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:36:47,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 17:36:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:36:47,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 17:36:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:36:47,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:36:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:36:47,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 17:36:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:36:47,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 17:36:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:36:47,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:36:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:36:47,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 17:36:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:36:47,062 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 17:36:47,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:36:47,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410080329] [2022-07-19 17:36:47,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410080329] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:36:47,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592163788] [2022-07-19 17:36:47,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 17:36:47,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:36:47,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:36:47,063 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-19 17:36:47,064 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-19 17:36:47,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 17:36:47,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:36:47,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 172 conjunts are in the unsatisfiable core [2022-07-19 17:36:47,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:36:47,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 17:36:47,209 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 7 treesize of output 6 [2022-07-19 17:36:47,264 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 17:36:47,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-19 17:36:47,288 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_683 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_683) |c_#memory_int|)) is different from true [2022-07-19 17:36:47,295 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 13 treesize of output 15 [2022-07-19 17:36:47,323 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 13 treesize of output 15 [2022-07-19 17:36:47,356 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 13 treesize of output 15 [2022-07-19 17:36:47,395 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 13 treesize of output 15 [2022-07-19 17:36:47,457 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 13 treesize of output 15 [2022-07-19 17:36:48,191 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_688 Int)) (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_688)) |c_#memory_int|)) is different from true [2022-07-19 17:36:50,835 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_691 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_691)))) is different from true [2022-07-19 17:36:55,579 WARN L855 $PredicateComparison]: unable to prove that (exists ((upsweep_~right Int) (v_ArrVal_693 Int) (v_ArrVal_688 Int)) (and (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ |c_upsweep_#in~a.offset| (* 4 |c_upsweep_#in~left|)) v_ArrVal_688) (+ (* upsweep_~right 4) |c_upsweep_#in~a.offset|) v_ArrVal_693)) |c_#memory_int|) (<= |c_upsweep_#in~right| upsweep_~right))) is different from true [2022-07-19 17:36:55,598 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 32 treesize of output 27 [2022-07-19 17:36:57,619 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 40 treesize of output 35 [2022-07-19 17:37:02,993 WARN L855 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_700 Int)) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (store .cse0 .cse1 v_ArrVal_700) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse0 .cse1)))) |c_#memory_int|)) is different from true [2022-07-19 17:37:06,401 WARN L855 $PredicateComparison]: unable to prove that (exists ((downsweep_~left Int) (v_ArrVal_704 Int) (v_ArrVal_703 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)) v_ArrVal_704) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_703))) (<= |c_downsweep_#in~left| downsweep_~left))) is different from true [2022-07-19 17:37:08,512 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_697 Int) (v_downsweep_~left_61 Int) (downsweep_~left Int) (v_ArrVal_704 Int) (v_ArrVal_703 Int) (v_ArrVal_700 Int)) (and (let ((.cse0 (div (+ |c_downsweep_#in~right| (* (- 1) |c_downsweep_#in~left|)) 2))) (or (and (< |c_downsweep_#in~right| |c_downsweep_#in~left|) (<= |c_downsweep_#in~right| (+ .cse0 downsweep_~left 1)) (not (= (mod (+ |c_downsweep_#in~right| |c_downsweep_#in~left|) 2) 0))) (<= |c_downsweep_#in~right| (+ .cse0 downsweep_~left)))) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (let ((.cse2 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (let ((.cse1 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|))) (store (store (store .cse1 .cse2 v_ArrVal_697) (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~left| 4)) v_ArrVal_700) (+ |c_downsweep_#in~a.offset| (* 4 v_downsweep_~left_61)) (select .cse1 .cse2))) .cse2 v_ArrVal_704)) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_703)) |c_#memory_int|))) is different from true [2022-07-19 17:37:08,600 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 89 treesize of output 82 [2022-07-19 17:37:21,926 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 108 treesize of output 102 [2022-07-19 17:37:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 17 not checked. [2022-07-19 17:37:21,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:37:24,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592163788] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:37:24,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 17:37:24,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 32] total 41 [2022-07-19 17:37:24,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002326671] [2022-07-19 17:37:24,636 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 17:37:24,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-19 17:37:24,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:37:24,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-19 17:37:24,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1223, Unknown=23, NotChecked=532, Total=1892 [2022-07-19 17:37:24,638 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand has 41 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 33 states have internal predecessors, (80), 11 states have call successors, (19), 3 states have call predecessors, (19), 9 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19) [2022-07-19 17:37:26,691 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 17:37:41,941 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_691 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_691)))) (exists ((v_ArrVal_688 Int)) (= (store |c_old(#memory_int)| |c_upsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_upsweep_#in~a.base|) (+ (* |c_upsweep_#in~right| 4) |c_upsweep_#in~a.offset|) v_ArrVal_688)) |c_#memory_int|))) is different from true [2022-07-19 17:37:51,788 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((downsweep_~left Int) (v_ArrVal_704 Int) (v_ArrVal_703 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)) v_ArrVal_704) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) v_ArrVal_703))) (<= |c_downsweep_#in~left| downsweep_~left))) (exists ((downsweep_~left Int) (v_ArrVal_700 Int)) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (store .cse0 .cse1 v_ArrVal_700) (+ |c_downsweep_#in~a.offset| (* downsweep_~left 4)) (select .cse0 .cse1)))) |c_#memory_int|))) is different from true [2022-07-19 17:37:51,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:37:51,817 INFO L93 Difference]: Finished difference Result 137 states and 192 transitions. [2022-07-19 17:37:51,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-19 17:37:51,841 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 33 states have internal predecessors, (80), 11 states have call successors, (19), 3 states have call predecessors, (19), 9 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19) Word has length 74 [2022-07-19 17:37:51,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:37:51,841 INFO L225 Difference]: With dead ends: 137 [2022-07-19 17:37:51,841 INFO L226 Difference]: Without dead ends: 102 [2022-07-19 17:37:51,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 60.7s TimeCoverageRelationStatistics Valid=456, Invalid=4099, Unknown=37, NotChecked=1260, Total=5852 [2022-07-19 17:37:51,844 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 25 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 1838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1214 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-19 17:37:51,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 385 Invalid, 1838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 581 Invalid, 1 Unknown, 1214 Unchecked, 2.5s Time] [2022-07-19 17:37:51,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-19 17:37:51,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2022-07-19 17:37:51,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 16 states have call successors, (16), 5 states have call predecessors, (16), 9 states have return successors, (31), 19 states have call predecessors, (31), 16 states have call successors, (31) [2022-07-19 17:37:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 110 transitions. [2022-07-19 17:37:51,860 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 110 transitions. Word has length 74 [2022-07-19 17:37:51,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:37:51,861 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 110 transitions. [2022-07-19 17:37:51,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 33 states have internal predecessors, (80), 11 states have call successors, (19), 3 states have call predecessors, (19), 9 states have return successors, (19), 11 states have call predecessors, (19), 11 states have call successors, (19) [2022-07-19 17:37:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 110 transitions. [2022-07-19 17:37:51,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-19 17:37:51,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:37:51,863 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:37:51,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 17:37:52,077 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-19 17:37:52,077 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:37:52,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:37:52,078 INFO L85 PathProgramCache]: Analyzing trace with hash 844735882, now seen corresponding path program 1 times [2022-07-19 17:37:52,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:37:52,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421582806] [2022-07-19 17:37:52,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:37:52,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:37:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:52,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:37:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:52,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 17:37:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:52,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 17:37:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:52,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:37:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:52,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:37:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:52,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:37:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:52,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 17:37:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:52,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:37:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:52,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 17:37:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:52,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 17:37:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:52,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:37:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:52,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 17:37:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:52,348 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-19 17:37:52,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:37:52,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421582806] [2022-07-19 17:37:52,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421582806] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:37:52,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358736815] [2022-07-19 17:37:52,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:37:52,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:37:52,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:37:52,350 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-19 17:37:52,351 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-19 17:37:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:52,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-19 17:37:52,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:37:52,672 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-19 17:37:52,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:37:53,594 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-19 17:37:53,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358736815] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:37:53,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:37:53,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 12] total 33 [2022-07-19 17:37:53,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050031915] [2022-07-19 17:37:53,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:37:53,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-19 17:37:53,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:37:53,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-19 17:37:53,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2022-07-19 17:37:53,595 INFO L87 Difference]: Start difference. First operand 83 states and 110 transitions. Second operand has 33 states, 29 states have (on average 3.103448275862069) internal successors, (90), 31 states have internal predecessors, (90), 10 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (29), 7 states have call predecessors, (29), 10 states have call successors, (29) [2022-07-19 17:37:55,672 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 17:37:57,813 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 17:37:58,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:37:58,980 INFO L93 Difference]: Finished difference Result 157 states and 224 transitions. [2022-07-19 17:37:58,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-19 17:37:58,981 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 3.103448275862069) internal successors, (90), 31 states have internal predecessors, (90), 10 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (29), 7 states have call predecessors, (29), 10 states have call successors, (29) Word has length 85 [2022-07-19 17:37:58,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:37:58,982 INFO L225 Difference]: With dead ends: 157 [2022-07-19 17:37:58,986 INFO L226 Difference]: Without dead ends: 116 [2022-07-19 17:37:58,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=320, Invalid=2436, Unknown=0, NotChecked=0, Total=2756 [2022-07-19 17:37:58,988 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 134 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 101 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-19 17:37:58,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 543 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 988 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2022-07-19 17:37:58,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-19 17:37:59,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 94. [2022-07-19 17:37:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 16 states have call successors, (16), 6 states have call predecessors, (16), 9 states have return successors, (29), 19 states have call predecessors, (29), 16 states have call successors, (29) [2022-07-19 17:37:59,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2022-07-19 17:37:59,009 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 85 [2022-07-19 17:37:59,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:37:59,009 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2022-07-19 17:37:59,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 3.103448275862069) internal successors, (90), 31 states have internal predecessors, (90), 10 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (29), 7 states have call predecessors, (29), 10 states have call successors, (29) [2022-07-19 17:37:59,010 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2022-07-19 17:37:59,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-19 17:37:59,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:37:59,011 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:37:59,028 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-19 17:37:59,228 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-19 17:37:59,228 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:37:59,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:37:59,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1782863912, now seen corresponding path program 2 times [2022-07-19 17:37:59,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:37:59,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246845765] [2022-07-19 17:37:59,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:37:59,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:37:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:59,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:37:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:59,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 17:37:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:59,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 17:37:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:59,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:37:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:59,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:37:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:59,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:37:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:59,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:37:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:59,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 17:37:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:59,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 17:37:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:59,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:37:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:59,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:37:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:59,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 17:37:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:59,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:37:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:59,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 17:37:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:37:59,406 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-19 17:37:59,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:37:59,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246845765] [2022-07-19 17:37:59,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246845765] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:37:59,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577075879] [2022-07-19 17:37:59,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 17:37:59,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:37:59,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:37:59,408 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-19 17:37:59,437 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-19 17:37:59,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 17:37:59,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:37:59,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 17:37:59,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:37:59,626 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-19 17:37:59,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:37:59,945 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-19 17:37:59,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577075879] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:37:59,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:37:59,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-07-19 17:37:59,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282525014] [2022-07-19 17:37:59,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:37:59,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 17:37:59,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:37:59,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 17:37:59,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-19 17:37:59,946 INFO L87 Difference]: Start difference. First operand 94 states and 120 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-19 17:38:00,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:38:00,122 INFO L93 Difference]: Finished difference Result 116 states and 157 transitions. [2022-07-19 17:38:00,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 17:38:00,123 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2022-07-19 17:38:00,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:38:00,124 INFO L225 Difference]: With dead ends: 116 [2022-07-19 17:38:00,124 INFO L226 Difference]: Without dead ends: 98 [2022-07-19 17:38:00,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 216 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-07-19 17:38:00,124 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 17 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:38:00,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 381 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:38:00,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-19 17:38:00,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-07-19 17:38:00,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.1) internal successors, (77), 69 states have internal predecessors, (77), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (27), 19 states have call predecessors, (27), 16 states have call successors, (27) [2022-07-19 17:38:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 120 transitions. [2022-07-19 17:38:00,136 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 120 transitions. Word has length 97 [2022-07-19 17:38:00,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:38:00,137 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 120 transitions. [2022-07-19 17:38:00,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-19 17:38:00,137 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2022-07-19 17:38:00,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-19 17:38:00,138 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:38:00,138 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:38:00,171 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-19 17:38:00,356 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-19 17:38:00,356 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:38:00,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:38:00,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1157064136, now seen corresponding path program 3 times [2022-07-19 17:38:00,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:38:00,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340614952] [2022-07-19 17:38:00,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:38:00,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:38:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:38:00,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:38:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:38:00,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 17:38:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:38:00,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 17:38:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:38:00,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 17:38:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:38:00,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 17:38:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:38:00,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:38:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:38:00,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:38:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:38:00,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 17:38:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:38:00,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 17:38:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:38:00,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:38:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:38:00,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 17:38:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:38:00,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 17:38:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:38:00,548 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-19 17:38:00,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:38:00,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340614952] [2022-07-19 17:38:00,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340614952] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:38:00,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622515964] [2022-07-19 17:38:00,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 17:38:00,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:38:00,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:38:00,564 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-19 17:38:00,613 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-19 17:38:00,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 17:38:00,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:38:00,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 115 conjunts are in the unsatisfiable core [2022-07-19 17:38:00,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:38:13,792 WARN L833 $PredicateComparison]: unable to prove that (and (= (div (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296) 2) |c_ULTIMATE.start_is_pow2_~x#1|) (<= (mod |c_ULTIMATE.start_main_~n~0#1| 2) 0) (< 1 |c_ULTIMATE.start_main_~n~0#1|) (< |c_ULTIMATE.start_main_~n~0#1| 1073741824)) is different from false [2022-07-19 17:38:31,083 WARN L833 $PredicateComparison]: unable to prove that (and (<= (mod |c_ULTIMATE.start_main_~n~0#1| 2) 0) (< 1 |c_ULTIMATE.start_main_~n~0#1|) (let ((.cse0 (= (mod (div (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296) 2) 4294967296) 1))) (or (and (= |c_ULTIMATE.start_is_pow2_#res#1| 0) (not .cse0)) (and .cse0 (= |c_ULTIMATE.start_is_pow2_#res#1| 1)))) (< |c_ULTIMATE.start_main_~n~0#1| 1073741824)) is different from false [2022-07-19 17:38:52,586 WARN L833 $PredicateComparison]: unable to prove that (and (<= (mod |c_ULTIMATE.start_main_~n~0#1| 2) 0) (let ((.cse0 (= (mod (div (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296) 2) 4294967296) 1))) (or (and (= |c_ULTIMATE.start_main_#t~ret14#1| 0) (not .cse0)) (and (= |c_ULTIMATE.start_main_#t~ret14#1| 1) .cse0))) (< 1 |c_ULTIMATE.start_main_~n~0#1|) (< |c_ULTIMATE.start_main_~n~0#1| 1073741824)) is different from false