./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 02:22:15,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 02:22:15,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 02:22:15,544 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 02:22:15,545 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 02:22:15,548 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 02:22:15,549 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 02:22:15,553 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 02:22:15,555 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 02:22:15,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 02:22:15,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 02:22:15,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 02:22:15,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 02:22:15,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 02:22:15,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 02:22:15,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 02:22:15,568 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 02:22:15,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 02:22:15,572 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 02:22:15,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 02:22:15,580 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 02:22:15,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 02:22:15,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 02:22:15,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 02:22:15,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 02:22:15,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 02:22:15,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 02:22:15,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 02:22:15,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 02:22:15,593 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 02:22:15,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 02:22:15,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 02:22:15,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 02:22:15,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 02:22:15,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 02:22:15,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 02:22:15,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 02:22:15,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 02:22:15,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 02:22:15,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 02:22:15,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 02:22:15,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 02:22:15,606 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-07-13 02:22:15,636 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 02:22:15,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 02:22:15,638 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 02:22:15,638 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 02:22:15,639 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 02:22:15,639 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 02:22:15,640 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 02:22:15,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 02:22:15,640 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 02:22:15,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 02:22:15,641 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 02:22:15,641 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 02:22:15,642 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 02:22:15,642 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 02:22:15,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 02:22:15,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 02:22:15,642 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 02:22:15,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 02:22:15,643 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-13 02:22:15,643 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 02:22:15,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 02:22:15,643 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 02:22:15,644 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 02:22:15,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 02:22:15,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 02:22:15,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 02:22:15,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 02:22:15,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 02:22:15,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 02:22:15,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 02:22:15,646 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 02:22:15,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 02:22:15,646 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 02:22:15,646 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 ! overflow) ) 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 -> ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 [2022-07-13 02:22:15,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 02:22:15,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 02:22:15,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 02:22:15,879 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 02:22:15,880 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 02:22:15,881 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2022-07-13 02:22:15,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59d3b8ec9/d1d287436b7343529fa9b4620809e1ad/FLAG6084935b4 [2022-07-13 02:22:16,429 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 02:22:16,430 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2022-07-13 02:22:16,445 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59d3b8ec9/d1d287436b7343529fa9b4620809e1ad/FLAG6084935b4 [2022-07-13 02:22:16,757 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59d3b8ec9/d1d287436b7343529fa9b4620809e1ad [2022-07-13 02:22:16,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 02:22:16,761 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 02:22:16,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 02:22:16,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 02:22:16,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 02:22:16,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:22:16" (1/1) ... [2022-07-13 02:22:16,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9114302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:16, skipping insertion in model container [2022-07-13 02:22:16,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:22:16" (1/1) ... [2022-07-13 02:22:16,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 02:22:16,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 02:22:17,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 02:22:17,180 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 02:22:17,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 02:22:17,263 INFO L208 MainTranslator]: Completed translation [2022-07-13 02:22:17,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:17 WrapperNode [2022-07-13 02:22:17,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 02:22:17,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 02:22:17,265 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 02:22:17,265 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 02:22:17,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:17" (1/1) ... [2022-07-13 02:22:17,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:17" (1/1) ... [2022-07-13 02:22:17,329 INFO L137 Inliner]: procedures = 262, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-07-13 02:22:17,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 02:22:17,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 02:22:17,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 02:22:17,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 02:22:17,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:17" (1/1) ... [2022-07-13 02:22:17,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:17" (1/1) ... [2022-07-13 02:22:17,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:17" (1/1) ... [2022-07-13 02:22:17,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:17" (1/1) ... [2022-07-13 02:22:17,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:17" (1/1) ... [2022-07-13 02:22:17,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:17" (1/1) ... [2022-07-13 02:22:17,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:17" (1/1) ... [2022-07-13 02:22:17,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 02:22:17,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 02:22:17,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 02:22:17,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 02:22:17,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:17" (1/1) ... [2022-07-13 02:22:17,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 02:22:17,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:22:17,425 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-13 02:22:17,443 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-13 02:22:17,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 02:22:17,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 02:22:17,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 02:22:17,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 02:22:17,476 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-13 02:22:17,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 02:22:17,476 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-07-13 02:22:17,476 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-07-13 02:22:17,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 02:22:17,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 02:22:17,477 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-13 02:22:17,634 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 02:22:17,636 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 02:22:17,765 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 02:22:17,771 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 02:22:17,772 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 02:22:17,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:22:17 BoogieIcfgContainer [2022-07-13 02:22:17,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 02:22:17,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 02:22:17,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 02:22:17,778 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 02:22:17,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:22:16" (1/3) ... [2022-07-13 02:22:17,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfcbca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:22:17, skipping insertion in model container [2022-07-13 02:22:17,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:17" (2/3) ... [2022-07-13 02:22:17,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bfcbca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:22:17, skipping insertion in model container [2022-07-13 02:22:17,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:22:17" (3/3) ... [2022-07-13 02:22:17,781 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2022-07-13 02:22:17,785 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-13 02:22:17,793 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 02:22:17,793 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-07-13 02:22:17,794 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-13 02:22:17,836 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-13 02:22:17,861 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-13 02:22:17,870 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 98 transitions, 201 flow [2022-07-13 02:22:17,872 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 98 transitions, 201 flow [2022-07-13 02:22:17,874 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 96 places, 98 transitions, 201 flow [2022-07-13 02:22:17,908 INFO L129 PetriNetUnfolder]: 6/97 cut-off events. [2022-07-13 02:22:17,908 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 02:22:17,912 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 97 events. 6/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 144 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-07-13 02:22:17,918 INFO L116 LiptonReduction]: Number of co-enabled transitions 2304 [2022-07-13 02:22:19,817 INFO L131 LiptonReduction]: Checked pairs total: 2843 [2022-07-13 02:22:19,817 INFO L133 LiptonReduction]: Total number of compositions: 93 [2022-07-13 02:22:19,824 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 27 transitions, 59 flow [2022-07-13 02:22:19,843 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 104 states, 78 states have (on average 2.6153846153846154) internal successors, (204), 103 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:19,857 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 02:22:19,863 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=FINITE_AUTOMATA, 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@48c05598, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12b8ef32 [2022-07-13 02:22:19,863 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-07-13 02:22:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 78 states have (on average 2.6153846153846154) internal successors, (204), 103 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:19,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-07-13 02:22:19,869 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:19,869 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-07-13 02:22:19,870 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:22:19,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:19,874 INFO L85 PathProgramCache]: Analyzing trace with hash 12029, now seen corresponding path program 1 times [2022-07-13 02:22:19,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:19,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627796689] [2022-07-13 02:22:19,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:19,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:19,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:22:19,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:19,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627796689] [2022-07-13 02:22:19,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627796689] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:19,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:19,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-13 02:22:19,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842738747] [2022-07-13 02:22:19,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:20,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 02:22:20,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:20,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 02:22:20,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 02:22:20,028 INFO L87 Difference]: Start difference. First operand has 104 states, 78 states have (on average 2.6153846153846154) internal successors, (204), 103 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:20,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:20,081 INFO L93 Difference]: Finished difference Result 103 states and 203 transitions. [2022-07-13 02:22:20,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 02:22:20,083 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-07-13 02:22:20,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:20,094 INFO L225 Difference]: With dead ends: 103 [2022-07-13 02:22:20,094 INFO L226 Difference]: Without dead ends: 103 [2022-07-13 02:22:20,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 02:22:20,098 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:20,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:22:20,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-13 02:22:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-07-13 02:22:20,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 78 states have (on average 2.6025641025641026) internal successors, (203), 102 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:20,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 203 transitions. [2022-07-13 02:22:20,152 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 203 transitions. Word has length 2 [2022-07-13 02:22:20,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:20,152 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 203 transitions. [2022-07-13 02:22:20,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 203 transitions. [2022-07-13 02:22:20,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-07-13 02:22:20,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:20,153 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-07-13 02:22:20,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 02:22:20,154 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:22:20,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:20,155 INFO L85 PathProgramCache]: Analyzing trace with hash 12051, now seen corresponding path program 1 times [2022-07-13 02:22:20,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:20,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883380898] [2022-07-13 02:22:20,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:20,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:20,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:22:20,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:20,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883380898] [2022-07-13 02:22:20,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883380898] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:20,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:20,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-13 02:22:20,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507218609] [2022-07-13 02:22:20,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:20,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:22:20,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:20,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:22:20,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 02:22:20,222 INFO L87 Difference]: Start difference. First operand 103 states and 203 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:20,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:20,268 INFO L93 Difference]: Finished difference Result 104 states and 204 transitions. [2022-07-13 02:22:20,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:22:20,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-07-13 02:22:20,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:20,271 INFO L225 Difference]: With dead ends: 104 [2022-07-13 02:22:20,272 INFO L226 Difference]: Without dead ends: 104 [2022-07-13 02:22:20,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-13 02:22:20,275 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:20,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:22:20,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-13 02:22:20,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-13 02:22:20,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 79 states have (on average 2.5822784810126582) internal successors, (204), 103 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 204 transitions. [2022-07-13 02:22:20,286 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 204 transitions. Word has length 2 [2022-07-13 02:22:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:20,286 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 204 transitions. [2022-07-13 02:22:20,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 204 transitions. [2022-07-13 02:22:20,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-13 02:22:20,287 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:20,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-13 02:22:20,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 02:22:20,288 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:22:20,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:20,288 INFO L85 PathProgramCache]: Analyzing trace with hash 373883, now seen corresponding path program 1 times [2022-07-13 02:22:20,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:20,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783679884] [2022-07-13 02:22:20,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:20,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:22:20,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:20,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783679884] [2022-07-13 02:22:20,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783679884] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:20,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:20,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 02:22:20,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262757995] [2022-07-13 02:22:20,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:20,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:22:20,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:20,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:22:20,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 02:22:20,322 INFO L87 Difference]: Start difference. First operand 104 states and 204 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:20,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:20,351 INFO L93 Difference]: Finished difference Result 103 states and 203 transitions. [2022-07-13 02:22:20,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:22:20,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-13 02:22:20,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:20,353 INFO L225 Difference]: With dead ends: 103 [2022-07-13 02:22:20,353 INFO L226 Difference]: Without dead ends: 103 [2022-07-13 02:22:20,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-13 02:22:20,355 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:20,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:22:20,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-13 02:22:20,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-07-13 02:22:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 2.569620253164557) internal successors, (203), 102 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:20,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 203 transitions. [2022-07-13 02:22:20,363 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 203 transitions. Word has length 3 [2022-07-13 02:22:20,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:20,363 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 203 transitions. [2022-07-13 02:22:20,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:20,364 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 203 transitions. [2022-07-13 02:22:20,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-13 02:22:20,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:20,364 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-13 02:22:20,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 02:22:20,365 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:22:20,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:20,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1745789244, now seen corresponding path program 1 times [2022-07-13 02:22:20,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:20,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240326155] [2022-07-13 02:22:20,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:20,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:20,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:22:20,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:20,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240326155] [2022-07-13 02:22:20,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240326155] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:22:20,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781105667] [2022-07-13 02:22:20,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:20,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:20,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:22:20,406 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-13 02:22:20,408 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-13 02:22:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:20,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 02:22:20,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:22:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:22:20,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:22:20,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:22:20,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781105667] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:22:20,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:22:20,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-07-13 02:22:20,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953334121] [2022-07-13 02:22:20,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:22:20,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 02:22:20,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:20,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 02:22:20,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:22:20,567 INFO L87 Difference]: Start difference. First operand 103 states and 203 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:20,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:20,655 INFO L93 Difference]: Finished difference Result 106 states and 206 transitions. [2022-07-13 02:22:20,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:22:20,656 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-13 02:22:20,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:20,657 INFO L225 Difference]: With dead ends: 106 [2022-07-13 02:22:20,657 INFO L226 Difference]: Without dead ends: 106 [2022-07-13 02:22:20,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:22:20,658 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:20,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:20,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-13 02:22:20,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-07-13 02:22:20,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 2.5121951219512195) internal successors, (206), 105 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 206 transitions. [2022-07-13 02:22:20,664 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 206 transitions. Word has length 6 [2022-07-13 02:22:20,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:20,665 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 206 transitions. [2022-07-13 02:22:20,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 206 transitions. [2022-07-13 02:22:20,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 02:22:20,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:20,665 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2022-07-13 02:22:20,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 02:22:20,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:20,885 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:22:20,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:20,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1994824916, now seen corresponding path program 2 times [2022-07-13 02:22:20,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:20,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384439458] [2022-07-13 02:22:20,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:20,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:22:20,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:20,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384439458] [2022-07-13 02:22:20,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384439458] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:22:20,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135025658] [2022-07-13 02:22:20,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:22:20,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:20,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:22:20,967 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-13 02:22:20,970 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-13 02:22:21,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 02:22:21,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:22:21,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 02:22:21,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:22:21,049 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-13 02:22:21,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:22:21,108 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-13 02:22:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 02:22:21,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:22:21,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135025658] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:21,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:22:21,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2022-07-13 02:22:21,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91208521] [2022-07-13 02:22:21,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:21,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:22:21,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:21,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:22:21,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-13 02:22:21,138 INFO L87 Difference]: Start difference. First operand 106 states and 206 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:21,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:21,206 INFO L93 Difference]: Finished difference Result 146 states and 286 transitions. [2022-07-13 02:22:21,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:22:21,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-13 02:22:21,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:21,208 INFO L225 Difference]: With dead ends: 146 [2022-07-13 02:22:21,208 INFO L226 Difference]: Without dead ends: 146 [2022-07-13 02:22:21,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-13 02:22:21,210 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:21,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:21,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-13 02:22:21,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 119. [2022-07-13 02:22:21,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 95 states have (on average 2.5052631578947366) internal successors, (238), 118 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 238 transitions. [2022-07-13 02:22:21,224 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 238 transitions. Word has length 9 [2022-07-13 02:22:21,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:21,224 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 238 transitions. [2022-07-13 02:22:21,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 238 transitions. [2022-07-13 02:22:21,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 02:22:21,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:21,225 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:21,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-13 02:22:21,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:21,431 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:22:21,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:21,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1710030101, now seen corresponding path program 1 times [2022-07-13 02:22:21,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:21,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176372561] [2022-07-13 02:22:21,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:21,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:22:21,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:21,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176372561] [2022-07-13 02:22:21,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176372561] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:22:21,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090607054] [2022-07-13 02:22:21,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:21,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:21,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:22:21,523 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-13 02:22:21,529 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-13 02:22:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:21,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 02:22:21,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:22:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:22:21,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:22:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:22:21,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090607054] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:22:21,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:22:21,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-07-13 02:22:21,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722039769] [2022-07-13 02:22:21,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:22:21,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 02:22:21,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:21,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 02:22:21,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-13 02:22:21,652 INFO L87 Difference]: Start difference. First operand 119 states and 238 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:21,719 INFO L93 Difference]: Finished difference Result 125 states and 244 transitions. [2022-07-13 02:22:21,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 02:22:21,719 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-13 02:22:21,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:21,720 INFO L225 Difference]: With dead ends: 125 [2022-07-13 02:22:21,720 INFO L226 Difference]: Without dead ends: 125 [2022-07-13 02:22:21,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-13 02:22:21,721 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:21,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:21,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-13 02:22:21,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-13 02:22:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 2.4158415841584158) internal successors, (244), 124 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:21,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 244 transitions. [2022-07-13 02:22:21,728 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 244 transitions. Word has length 10 [2022-07-13 02:22:21,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:21,728 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 244 transitions. [2022-07-13 02:22:21,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:21,728 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 244 transitions. [2022-07-13 02:22:21,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 02:22:21,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:21,729 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:21,753 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-13 02:22:21,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:21,951 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:22:21,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:21,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1621603861, now seen corresponding path program 2 times [2022-07-13 02:22:21,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:21,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857307166] [2022-07-13 02:22:21,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:21,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:22:22,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:22,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857307166] [2022-07-13 02:22:22,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857307166] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:22,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:22,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 02:22:22,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800206749] [2022-07-13 02:22:22,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:22,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:22:22,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:22,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:22:22,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:22:22,086 INFO L87 Difference]: Start difference. First operand 125 states and 244 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:22,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:22,156 INFO L93 Difference]: Finished difference Result 145 states and 278 transitions. [2022-07-13 02:22:22,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:22:22,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-13 02:22:22,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:22,159 INFO L225 Difference]: With dead ends: 145 [2022-07-13 02:22:22,159 INFO L226 Difference]: Without dead ends: 145 [2022-07-13 02:22:22,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:22:22,160 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:22,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:22,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-13 02:22:22,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2022-07-13 02:22:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 108 states have (on average 2.388888888888889) internal successors, (258), 131 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 258 transitions. [2022-07-13 02:22:22,165 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 258 transitions. Word has length 16 [2022-07-13 02:22:22,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:22,166 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 258 transitions. [2022-07-13 02:22:22,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:22,166 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 258 transitions. [2022-07-13 02:22:22,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 02:22:22,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:22,166 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:22,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 02:22:22,167 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:22:22,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:22,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1621594451, now seen corresponding path program 1 times [2022-07-13 02:22:22,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:22,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644354800] [2022-07-13 02:22:22,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:22,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:22,223 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:22:22,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:22,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644354800] [2022-07-13 02:22:22,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644354800] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:22,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:22,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 02:22:22,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929167736] [2022-07-13 02:22:22,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:22,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:22:22,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:22,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:22:22,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:22:22,225 INFO L87 Difference]: Start difference. First operand 132 states and 258 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:22,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:22,295 INFO L93 Difference]: Finished difference Result 135 states and 258 transitions. [2022-07-13 02:22:22,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:22:22,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-13 02:22:22,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:22,297 INFO L225 Difference]: With dead ends: 135 [2022-07-13 02:22:22,299 INFO L226 Difference]: Without dead ends: 135 [2022-07-13 02:22:22,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:22:22,300 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:22,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:22,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-13 02:22:22,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2022-07-13 02:22:22,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 108 states have (on average 2.3518518518518516) internal successors, (254), 131 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 254 transitions. [2022-07-13 02:22:22,308 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 254 transitions. Word has length 16 [2022-07-13 02:22:22,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:22,308 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 254 transitions. [2022-07-13 02:22:22,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 254 transitions. [2022-07-13 02:22:22,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 02:22:22,325 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:22,325 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:22,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 02:22:22,325 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:22:22,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:22,326 INFO L85 PathProgramCache]: Analyzing trace with hash 711829442, now seen corresponding path program 1 times [2022-07-13 02:22:22,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:22,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873398394] [2022-07-13 02:22:22,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:22,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:22,374 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:22:22,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:22,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873398394] [2022-07-13 02:22:22,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873398394] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:22,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:22,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 02:22:22,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394672014] [2022-07-13 02:22:22,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:22,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:22:22,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:22,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:22:22,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 02:22:22,375 INFO L87 Difference]: Start difference. First operand 132 states and 254 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:22,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:22,417 INFO L93 Difference]: Finished difference Result 184 states and 357 transitions. [2022-07-13 02:22:22,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:22:22,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-13 02:22:22,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:22,420 INFO L225 Difference]: With dead ends: 184 [2022-07-13 02:22:22,420 INFO L226 Difference]: Without dead ends: 184 [2022-07-13 02:22:22,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-13 02:22:22,421 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:22,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:22:22,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-13 02:22:22,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 166. [2022-07-13 02:22:22,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 142 states have (on average 2.387323943661972) internal successors, (339), 165 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 339 transitions. [2022-07-13 02:22:22,426 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 339 transitions. Word has length 18 [2022-07-13 02:22:22,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:22,426 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 339 transitions. [2022-07-13 02:22:22,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:22,427 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 339 transitions. [2022-07-13 02:22:22,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 02:22:22,427 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:22,427 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:22,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 02:22:22,428 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:22:22,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:22,428 INFO L85 PathProgramCache]: Analyzing trace with hash 720871045, now seen corresponding path program 1 times [2022-07-13 02:22:22,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:22,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766428107] [2022-07-13 02:22:22,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:22,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:22,460 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:22:22,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:22,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766428107] [2022-07-13 02:22:22,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766428107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:22,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:22,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 02:22:22,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505797907] [2022-07-13 02:22:22,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:22,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:22:22,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:22,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:22:22,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 02:22:22,462 INFO L87 Difference]: Start difference. First operand 166 states and 339 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:22,502 INFO L93 Difference]: Finished difference Result 228 states and 464 transitions. [2022-07-13 02:22:22,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:22:22,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-13 02:22:22,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:22,504 INFO L225 Difference]: With dead ends: 228 [2022-07-13 02:22:22,504 INFO L226 Difference]: Without dead ends: 228 [2022-07-13 02:22:22,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-13 02:22:22,505 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:22,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:22:22,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-13 02:22:22,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 208. [2022-07-13 02:22:22,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 184 states have (on average 2.4130434782608696) internal successors, (444), 207 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 444 transitions. [2022-07-13 02:22:22,511 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 444 transitions. Word has length 18 [2022-07-13 02:22:22,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:22,511 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 444 transitions. [2022-07-13 02:22:22,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:22,512 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 444 transitions. [2022-07-13 02:22:22,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 02:22:22,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:22,512 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:22,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 02:22:22,513 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:22:22,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:22,513 INFO L85 PathProgramCache]: Analyzing trace with hash 591876604, now seen corresponding path program 1 times [2022-07-13 02:22:22,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:22,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058076547] [2022-07-13 02:22:22,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:22,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:22,626 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:22:22,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:22,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058076547] [2022-07-13 02:22:22,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058076547] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:22:22,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117967196] [2022-07-13 02:22:22,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:22,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:22,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:22:22,628 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-13 02:22:22,660 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-13 02:22:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:22,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:22:22,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:22:22,748 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-13 02:22:22,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:22:22,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-13 02:22:22,879 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 18 treesize of output 13 [2022-07-13 02:22:32,157 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:22:32,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:22:37,438 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_152| Int) (|v_ULTIMATE.start_main_~i~2#1_116| Int) (v_ArrVal_274 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_151| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_32| Int) (v_ArrVal_273 (Array Int Int)) (|ULTIMATE.start_main_~i~2#1| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_116|)) (<= 0 (+ 2147483649 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_32| v_ArrVal_273) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_152| v_ArrVal_274) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_151|))) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_151|) (+ (* |v_ULTIMATE.start_main_~i~2#1_116| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_152|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_32|)))) is different from false [2022-07-13 02:22:37,674 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:22:37,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117967196] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:22:37,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:22:37,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-07-13 02:22:37,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841959803] [2022-07-13 02:22:37,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:22:37,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 02:22:37,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:37,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 02:22:37,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=148, Unknown=15, NotChecked=28, Total=272 [2022-07-13 02:22:37,677 INFO L87 Difference]: Start difference. First operand 208 states and 444 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:37,683 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_152| Int) (|v_ULTIMATE.start_main_~i~2#1_116| Int) (v_ArrVal_274 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_151| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_32| Int) (v_ArrVal_273 (Array Int Int)) (|ULTIMATE.start_main_~i~2#1| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_116|)) (<= 0 (+ 2147483649 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_32| v_ArrVal_273) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_152| v_ArrVal_274) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_151|))) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_151|) (+ (* |v_ULTIMATE.start_main_~i~2#1_116| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_152|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_32|)))) (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|))) is different from false [2022-07-13 02:22:47,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:47,102 INFO L93 Difference]: Finished difference Result 282 states and 649 transitions. [2022-07-13 02:22:47,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 02:22:47,103 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-13 02:22:47,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:47,105 INFO L225 Difference]: With dead ends: 282 [2022-07-13 02:22:47,105 INFO L226 Difference]: Without dead ends: 282 [2022-07-13 02:22:47,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=124, Invalid=243, Unknown=21, NotChecked=74, Total=462 [2022-07-13 02:22:47,105 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 248 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:47,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 248 Unchecked, 0.1s Time] [2022-07-13 02:22:47,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-13 02:22:47,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 240. [2022-07-13 02:22:47,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 216 states have (on average 2.4814814814814814) internal successors, (536), 239 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:47,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 536 transitions. [2022-07-13 02:22:47,111 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 536 transitions. Word has length 19 [2022-07-13 02:22:47,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:47,112 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 536 transitions. [2022-07-13 02:22:47,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:47,112 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 536 transitions. [2022-07-13 02:22:47,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 02:22:47,114 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:47,114 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:47,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-13 02:22:47,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:47,330 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:22:47,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:47,330 INFO L85 PathProgramCache]: Analyzing trace with hash 564196735, now seen corresponding path program 1 times [2022-07-13 02:22:47,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:47,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897525131] [2022-07-13 02:22:47,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:47,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:47,449 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:22:47,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:47,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897525131] [2022-07-13 02:22:47,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897525131] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:47,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:47,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 02:22:47,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393274654] [2022-07-13 02:22:47,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:47,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 02:22:47,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:47,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 02:22:47,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:22:47,453 INFO L87 Difference]: Start difference. First operand 240 states and 536 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:47,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:47,565 INFO L93 Difference]: Finished difference Result 271 states and 596 transitions. [2022-07-13 02:22:47,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 02:22:47,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-13 02:22:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:47,567 INFO L225 Difference]: With dead ends: 271 [2022-07-13 02:22:47,567 INFO L226 Difference]: Without dead ends: 271 [2022-07-13 02:22:47,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:22:47,568 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:47,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:47,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-13 02:22:47,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 252. [2022-07-13 02:22:47,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 228 states have (on average 2.4517543859649122) internal successors, (559), 251 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:47,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 559 transitions. [2022-07-13 02:22:47,601 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 559 transitions. Word has length 19 [2022-07-13 02:22:47,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:47,601 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 559 transitions. [2022-07-13 02:22:47,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 559 transitions. [2022-07-13 02:22:47,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 02:22:47,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:47,601 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:47,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 02:22:47,602 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:22:47,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:47,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1168272817, now seen corresponding path program 1 times [2022-07-13 02:22:47,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:47,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821738367] [2022-07-13 02:22:47,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:47,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:22:47,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:47,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821738367] [2022-07-13 02:22:47,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821738367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:47,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:47,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 02:22:47,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108177484] [2022-07-13 02:22:47,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:47,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 02:22:47,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:47,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 02:22:47,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-13 02:22:47,749 INFO L87 Difference]: Start difference. First operand 252 states and 559 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:47,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:47,996 INFO L93 Difference]: Finished difference Result 286 states and 614 transitions. [2022-07-13 02:22:47,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 02:22:47,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-13 02:22:47,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:47,998 INFO L225 Difference]: With dead ends: 286 [2022-07-13 02:22:47,998 INFO L226 Difference]: Without dead ends: 286 [2022-07-13 02:22:47,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-07-13 02:22:47,999 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:47,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:48,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-13 02:22:48,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 262. [2022-07-13 02:22:48,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 238 states have (on average 2.4411764705882355) internal successors, (581), 261 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:48,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 581 transitions. [2022-07-13 02:22:48,006 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 581 transitions. Word has length 20 [2022-07-13 02:22:48,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:48,006 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 581 transitions. [2022-07-13 02:22:48,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:48,007 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 581 transitions. [2022-07-13 02:22:48,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 02:22:48,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:48,007 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:48,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 02:22:48,008 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:22:48,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:48,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1168272838, now seen corresponding path program 1 times [2022-07-13 02:22:48,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:48,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331234582] [2022-07-13 02:22:48,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:48,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:48,136 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:22:48,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:48,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331234582] [2022-07-13 02:22:48,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331234582] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:48,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:48,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 02:22:48,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935825956] [2022-07-13 02:22:48,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:48,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 02:22:48,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:48,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 02:22:48,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-13 02:22:48,138 INFO L87 Difference]: Start difference. First operand 262 states and 581 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:48,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:48,376 INFO L93 Difference]: Finished difference Result 271 states and 581 transitions. [2022-07-13 02:22:48,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 02:22:48,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-13 02:22:48,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:48,378 INFO L225 Difference]: With dead ends: 271 [2022-07-13 02:22:48,378 INFO L226 Difference]: Without dead ends: 271 [2022-07-13 02:22:48,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-07-13 02:22:48,379 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:48,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:48,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-13 02:22:48,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 256. [2022-07-13 02:22:48,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 232 states have (on average 2.418103448275862) internal successors, (561), 255 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 561 transitions. [2022-07-13 02:22:48,396 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 561 transitions. Word has length 20 [2022-07-13 02:22:48,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:48,396 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 561 transitions. [2022-07-13 02:22:48,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:22:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 561 transitions. [2022-07-13 02:22:48,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 02:22:48,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:48,400 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:48,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 02:22:48,400 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:22:48,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:48,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1168305691, now seen corresponding path program 1 times [2022-07-13 02:22:48,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:48,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384331900] [2022-07-13 02:22:48,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:48,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:48,557 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:22:48,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:48,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384331900] [2022-07-13 02:22:48,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384331900] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:22:48,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230447106] [2022-07-13 02:22:48,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:48,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:48,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:22:48,560 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-13 02:22:48,564 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-13 02:22:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:48,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:22:48,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:22:48,667 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-13 02:22:48,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:22:48,736 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-13 02:22:48,793 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 18 treesize of output 13 [2022-07-13 02:22:59,930 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:22:59,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:23:06,628 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_154| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_155| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_33| Int) (|v_ULTIMATE.start_main_~i~2#1_120| Int) (v_ArrVal_437 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_33| v_ArrVal_436) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_155| v_ArrVal_437) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_154|) 2147483646) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_120|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_33|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_154|) (+ (* |v_ULTIMATE.start_main_~i~2#1_120| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_155|)))) is different from false [2022-07-13 02:23:06,800 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:23:06,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230447106] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:23:06,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:23:06,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-13 02:23:06,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672964334] [2022-07-13 02:23:06,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:23:06,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:23:06,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:23:06,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:23:06,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=207, Unknown=18, NotChecked=32, Total=342 [2022-07-13 02:23:06,805 INFO L87 Difference]: Start difference. First operand 256 states and 561 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:23:06,809 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((v_ArrVal_436 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_154| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_155| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_33| Int) (|v_ULTIMATE.start_main_~i~2#1_120| Int) (v_ArrVal_437 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_33| v_ArrVal_436) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_155| v_ArrVal_437) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_154|) 2147483646) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_120|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_33|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_154|) (+ (* |v_ULTIMATE.start_main_~i~2#1_120| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_155|))))) is different from false [2022-07-13 02:23:07,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:23:07,924 INFO L93 Difference]: Finished difference Result 297 states and 634 transitions. [2022-07-13 02:23:07,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 02:23:07,924 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-13 02:23:07,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:23:07,926 INFO L225 Difference]: With dead ends: 297 [2022-07-13 02:23:07,926 INFO L226 Difference]: Without dead ends: 297 [2022-07-13 02:23:07,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=94, Invalid=237, Unknown=19, NotChecked=70, Total=420 [2022-07-13 02:23:07,926 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:23:07,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 134 Unchecked, 0.1s Time] [2022-07-13 02:23:07,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-07-13 02:23:07,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 259. [2022-07-13 02:23:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 235 states have (on average 2.4170212765957446) internal successors, (568), 258 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:23:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 568 transitions. [2022-07-13 02:23:07,933 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 568 transitions. Word has length 20 [2022-07-13 02:23:07,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:23:07,933 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 568 transitions. [2022-07-13 02:23:07,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:23:07,933 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 568 transitions. [2022-07-13 02:23:07,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 02:23:07,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:23:07,934 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:23:07,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-13 02:23:08,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 02:23:08,135 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:23:08,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:23:08,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1176055102, now seen corresponding path program 1 times [2022-07-13 02:23:08,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:23:08,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814928602] [2022-07-13 02:23:08,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:23:08,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:23:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:23:08,255 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:23:08,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:23:08,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814928602] [2022-07-13 02:23:08,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814928602] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:23:08,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:23:08,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 02:23:08,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45311970] [2022-07-13 02:23:08,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:23:08,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 02:23:08,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:23:08,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 02:23:08,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 02:23:08,257 INFO L87 Difference]: Start difference. First operand 259 states and 568 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:23:08,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:23:08,431 INFO L93 Difference]: Finished difference Result 287 states and 614 transitions. [2022-07-13 02:23:08,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 02:23:08,431 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-13 02:23:08,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:23:08,433 INFO L225 Difference]: With dead ends: 287 [2022-07-13 02:23:08,433 INFO L226 Difference]: Without dead ends: 287 [2022-07-13 02:23:08,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-07-13 02:23:08,433 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:23:08,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:23:08,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-07-13 02:23:08,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 268. [2022-07-13 02:23:08,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 244 states have (on average 2.401639344262295) internal successors, (586), 267 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:23:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 586 transitions. [2022-07-13 02:23:08,442 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 586 transitions. Word has length 20 [2022-07-13 02:23:08,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:23:08,442 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 586 transitions. [2022-07-13 02:23:08,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:23:08,442 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 586 transitions. [2022-07-13 02:23:08,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 02:23:08,444 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:23:08,444 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:23:08,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 02:23:08,444 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:23:08,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:23:08,445 INFO L85 PathProgramCache]: Analyzing trace with hash 310229752, now seen corresponding path program 2 times [2022-07-13 02:23:08,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:23:08,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966852116] [2022-07-13 02:23:08,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:23:08,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:23:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:23:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:23:08,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:23:08,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966852116] [2022-07-13 02:23:08,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966852116] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:23:08,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:23:08,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 02:23:08,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436056560] [2022-07-13 02:23:08,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:23:08,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 02:23:08,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:23:08,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 02:23:08,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-13 02:23:08,565 INFO L87 Difference]: Start difference. First operand 268 states and 586 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:23:08,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:23:08,773 INFO L93 Difference]: Finished difference Result 290 states and 619 transitions. [2022-07-13 02:23:08,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 02:23:08,774 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-13 02:23:08,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:23:08,775 INFO L225 Difference]: With dead ends: 290 [2022-07-13 02:23:08,775 INFO L226 Difference]: Without dead ends: 290 [2022-07-13 02:23:08,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-07-13 02:23:08,776 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:23:08,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:23:08,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-13 02:23:08,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 265. [2022-07-13 02:23:08,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 241 states have (on average 2.4024896265560165) internal successors, (579), 264 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:23:08,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 579 transitions. [2022-07-13 02:23:08,782 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 579 transitions. Word has length 20 [2022-07-13 02:23:08,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:23:08,782 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 579 transitions. [2022-07-13 02:23:08,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:23:08,782 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 579 transitions. [2022-07-13 02:23:08,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 02:23:08,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:23:08,783 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:23:08,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 02:23:08,783 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:23:08,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:23:08,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1267351382, now seen corresponding path program 1 times [2022-07-13 02:23:08,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:23:08,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749324539] [2022-07-13 02:23:08,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:23:08,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:23:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:23:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:23:08,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:23:08,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749324539] [2022-07-13 02:23:08,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749324539] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:23:08,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499839903] [2022-07-13 02:23:08,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:23:08,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:23:08,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:23:08,906 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-13 02:23:08,906 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-13 02:23:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:23:09,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:23:09,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:23:09,010 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-13 02:23:09,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:23:09,067 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-13 02:23:09,125 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 18 treesize of output 13 [2022-07-13 02:23:23,548 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:23:23,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:23:31,311 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_568 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_126| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_34| Int) (v_ArrVal_569 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_158| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_159| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_126|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_34|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_158|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_126| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_159|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_34| v_ArrVal_568) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_159| v_ArrVal_569) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_158|) 2147483646))) is different from false [2022-07-13 02:23:31,454 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:23:31,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499839903] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:23:31,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:23:31,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-13 02:23:31,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837769166] [2022-07-13 02:23:31,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:23:31,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:23:31,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:23:31,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:23:31,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=209, Unknown=18, NotChecked=32, Total=342 [2022-07-13 02:23:31,456 INFO L87 Difference]: Start difference. First operand 265 states and 579 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:23:31,461 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((v_ArrVal_568 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_126| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_34| Int) (v_ArrVal_569 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_158| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_159| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_126|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_34|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_158|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_126| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_159|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_34| v_ArrVal_568) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_159| v_ArrVal_569) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_158|) 2147483646)))) is different from false [2022-07-13 02:23:35,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:23:35,243 INFO L93 Difference]: Finished difference Result 275 states and 605 transitions. [2022-07-13 02:23:35,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 02:23:35,244 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-13 02:23:35,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:23:35,245 INFO L225 Difference]: With dead ends: 275 [2022-07-13 02:23:35,246 INFO L226 Difference]: Without dead ends: 275 [2022-07-13 02:23:35,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=107, Invalid=260, Unknown=21, NotChecked=74, Total=462 [2022-07-13 02:23:35,246 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:23:35,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 140 Unchecked, 0.0s Time] [2022-07-13 02:23:35,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-13 02:23:35,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2022-07-13 02:23:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 248 states have (on average 2.4153225806451615) internal successors, (599), 271 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:23:35,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 599 transitions. [2022-07-13 02:23:35,253 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 599 transitions. Word has length 20 [2022-07-13 02:23:35,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:23:35,253 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 599 transitions. [2022-07-13 02:23:35,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:23:35,253 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 599 transitions. [2022-07-13 02:23:35,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 02:23:35,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:23:35,254 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:23:35,279 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-13 02:23:35,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 02:23:35,477 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:23:35,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:23:35,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1267351403, now seen corresponding path program 1 times [2022-07-13 02:23:35,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:23:35,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099814903] [2022-07-13 02:23:35,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:23:35,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:23:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:23:35,614 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:23:35,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:23:35,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099814903] [2022-07-13 02:23:35,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099814903] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:23:35,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955536014] [2022-07-13 02:23:35,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:23:35,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:23:35,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:23:35,616 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-13 02:23:35,618 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-13 02:23:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:23:35,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:23:35,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:23:35,721 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-13 02:23:35,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:23:35,774 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-13 02:23:35,823 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 18 treesize of output 13 [2022-07-13 02:23:48,662 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:23:48,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:23:58,009 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_638 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_35| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_163| Int) (v_ArrVal_639 Int) (|v_t_funThread1of1ForFork0_~i~0#1_130| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (<= 0 (+ 2147483649 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_35| v_ArrVal_638) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_163| v_ArrVal_639) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162|))) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_130| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_163|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_35|)) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_130|)))) is different from false [2022-07-13 02:23:58,171 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:23:58,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955536014] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:23:58,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:23:58,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-13 02:23:58,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634205160] [2022-07-13 02:23:58,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:23:58,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:23:58,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:23:58,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:23:58,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=203, Unknown=20, NotChecked=32, Total=342 [2022-07-13 02:23:58,173 INFO L87 Difference]: Start difference. First operand 272 states and 599 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:23:58,178 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_638 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_35| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_163| Int) (v_ArrVal_639 Int) (|v_t_funThread1of1ForFork0_~i~0#1_130| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (<= 0 (+ 2147483649 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_35| v_ArrVal_638) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_163| v_ArrVal_639) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162|))) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_130| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_163|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_35|)) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_130|)))) (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|))) is different from false [2022-07-13 02:24:08,761 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_639 Int)) (and (= (store ((as const (Array Int Int)) 0) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_639) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) (= |c_~#cache~0.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_163| Int) (v_ArrVal_639 Int) (|v_t_funThread1of1ForFork0_~i~0#1_130| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_130| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_163|)) (<= 0 (+ 2147483649 (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_163| v_ArrVal_639) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162|))) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_130|)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162| Int)) (or (<= 0 (+ 2147483649 (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) (<= 0 (+ (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483648))) is different from false [2022-07-13 02:24:10,802 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162| Int) (v_ArrVal_639 Int) (|v_t_funThread1of1ForFork0_~i~0#1_130| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_130| 28) |c_~#cache~0.offset|)) (<= 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_639)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162|))) (not (<= (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_130|)))) (= .cse0 (store .cse1 .cse2 0)) (= |c_~#cache~0.base| 1) (<= 0 (+ (select .cse1 .cse2) 2147483648)) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_639 Int) (|v_t_funThread1of1ForFork0_~i~0#1_129| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (and (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_129| 1) |t_funThread1of1ForFork0_~i~0#1|) (<= (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_129| 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= (store ((as const (Array Int Int)) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161| v_ArrVal_639) (select |c_#memory_int| 1)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_639 Int) (|v_t_funThread1of1ForFork0_~i~0#1_129| Int)) (and (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_129| 1) |c_t_funThread1of1ForFork0_~i~0#1|) (= (store ((as const (Array Int Int)) 0) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_639) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_129| 28) |c_~#cache~0.offset|))))))) is different from false [2022-07-13 02:24:21,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:24:21,411 INFO L93 Difference]: Finished difference Result 358 states and 814 transitions. [2022-07-13 02:24:21,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 02:24:21,411 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-13 02:24:21,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:24:21,413 INFO L225 Difference]: With dead ends: 358 [2022-07-13 02:24:21,413 INFO L226 Difference]: Without dead ends: 358 [2022-07-13 02:24:21,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 45.3s TimeCoverageRelationStatistics Valid=152, Invalid=386, Unknown=30, NotChecked=188, Total=756 [2022-07-13 02:24:21,414 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 87 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 477 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:24:21,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 0 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 110 Invalid, 0 Unknown, 477 Unchecked, 0.1s Time] [2022-07-13 02:24:21,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-07-13 02:24:21,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 305. [2022-07-13 02:24:21,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 281 states have (on average 2.4661921708185055) internal successors, (693), 304 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:24:21,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 693 transitions. [2022-07-13 02:24:21,428 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 693 transitions. Word has length 20 [2022-07-13 02:24:21,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:24:21,428 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 693 transitions. [2022-07-13 02:24:21,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:24:21,429 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 693 transitions. [2022-07-13 02:24:21,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 02:24:21,429 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:24:21,430 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:24:21,457 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-13 02:24:21,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:24:21,651 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:24:21,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:24:21,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1857738638, now seen corresponding path program 1 times [2022-07-13 02:24:21,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:24:21,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229610769] [2022-07-13 02:24:21,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:24:21,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:24:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:24:21,769 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:24:21,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:24:21,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229610769] [2022-07-13 02:24:21,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229610769] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:24:21,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384749125] [2022-07-13 02:24:21,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:24:21,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:24:21,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:24:21,771 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-13 02:24:21,798 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-13 02:24:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:24:21,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:24:21,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:24:21,884 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-13 02:24:21,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:24:21,946 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-13 02:24:22,004 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 18 treesize of output 13 [2022-07-13 02:24:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:24:36,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:24:43,952 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~2#1_126| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_36| Int) (v_ArrVal_708 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_157| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_158| Int) (v_ArrVal_710 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_36|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_157|) (+ (* |v_ULTIMATE.start_main_~i~2#1_126| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_158|)) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_126|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_36| v_ArrVal_708) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_158| v_ArrVal_710) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_157|) 2147483646))) is different from false [2022-07-13 02:24:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:24:44,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384749125] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:24:44,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:24:44,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-13 02:24:44,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043320800] [2022-07-13 02:24:44,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:24:44,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:24:44,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:24:44,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:24:44,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=208, Unknown=19, NotChecked=32, Total=342 [2022-07-13 02:24:44,089 INFO L87 Difference]: Start difference. First operand 305 states and 693 transitions. Second operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:24:44,094 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_ULTIMATE.start_main_~i~2#1_126| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_36| Int) (v_ArrVal_708 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_157| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_158| Int) (v_ArrVal_710 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_36|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_157|) (+ (* |v_ULTIMATE.start_main_~i~2#1_126| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_158|)) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_126|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_36| v_ArrVal_708) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_158| v_ArrVal_710) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_157|) 2147483646)))) is different from false [2022-07-13 02:24:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:24:47,951 INFO L93 Difference]: Finished difference Result 360 states and 798 transitions. [2022-07-13 02:24:47,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 02:24:47,952 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-13 02:24:47,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:24:47,953 INFO L225 Difference]: With dead ends: 360 [2022-07-13 02:24:47,954 INFO L226 Difference]: Without dead ends: 360 [2022-07-13 02:24:47,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=107, Invalid=259, Unknown=22, NotChecked=74, Total=462 [2022-07-13 02:24:47,954 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:24:47,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 182 Invalid, 0 Unknown, 190 Unchecked, 0.1s Time] [2022-07-13 02:24:47,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-07-13 02:24:47,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 304. [2022-07-13 02:24:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 280 states have (on average 2.4535714285714287) internal successors, (687), 303 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:24:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 687 transitions. [2022-07-13 02:24:47,962 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 687 transitions. Word has length 21 [2022-07-13 02:24:47,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:24:47,962 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 687 transitions. [2022-07-13 02:24:47,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:24:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 687 transitions. [2022-07-13 02:24:47,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 02:24:47,963 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:24:47,963 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:24:47,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 02:24:48,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:24:48,186 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:24:48,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:24:48,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1857709808, now seen corresponding path program 2 times [2022-07-13 02:24:48,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:24:48,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839147455] [2022-07-13 02:24:48,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:24:48,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:24:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:24:48,288 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:24:48,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:24:48,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839147455] [2022-07-13 02:24:48,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839147455] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:24:48,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795603179] [2022-07-13 02:24:48,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:24:48,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:24:48,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:24:48,292 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-13 02:24:48,295 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-13 02:24:48,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 02:24:48,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:24:48,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:24:48,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:24:48,406 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-13 02:24:48,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:24:48,468 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-13 02:24:48,519 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 18 treesize of output 13 [2022-07-13 02:24:56,525 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:24:56,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:25:03,741 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_778 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_37| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_160| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (|v_ULTIMATE.start_main_~i~2#1_130| Int) (v_ArrVal_779 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_37| v_ArrVal_778) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| v_ArrVal_779) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_160|) 2147483646) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_130|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_37|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_160|) (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| (* |v_ULTIMATE.start_main_~i~2#1_130| 28))))) is different from false [2022-07-13 02:25:03,883 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:25:03,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795603179] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:25:03,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:25:03,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-13 02:25:03,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434243766] [2022-07-13 02:25:03,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:25:03,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:25:03,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:25:03,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:25:03,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=206, Unknown=19, NotChecked=32, Total=342 [2022-07-13 02:25:03,885 INFO L87 Difference]: Start difference. First operand 304 states and 687 transitions. Second operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:25:03,891 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((v_ArrVal_778 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_37| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_160| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (|v_ULTIMATE.start_main_~i~2#1_130| Int) (v_ArrVal_779 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_37| v_ArrVal_778) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| v_ArrVal_779) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_160|) 2147483646) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_130|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_37|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_160|) (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| (* |v_ULTIMATE.start_main_~i~2#1_130| 28)))))) is different from false [2022-07-13 02:25:04,463 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_160| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (|v_ULTIMATE.start_main_~i~2#1_130| Int) (v_ArrVal_779 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_130|)) (<= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| v_ArrVal_779) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_160|) 2147483646) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_160|) (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| (* |v_ULTIMATE.start_main_~i~2#1_130| 28))))) (= .cse0 (store .cse1 .cse2 0)) (or (= .cse0 .cse1) (<= (+ 28 .cse2) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)))))) is different from false [2022-07-13 02:25:05,679 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_160| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| Int) (|v_ULTIMATE.start_main_~i~2#1_130| Int) (v_ArrVal_779 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_130|)) (<= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| v_ArrVal_779) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_160|) 2147483646) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_160|) (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_161| (* |v_ULTIMATE.start_main_~i~2#1_130| 28))))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_160| Int) (|v_ULTIMATE.start_main_~i~2#1_130| Int) (v_ArrVal_779 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_130|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_160| (+ (* |v_ULTIMATE.start_main_~i~2#1_130| 28) |c_~#cache~0.offset|)) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_779)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_160|) 2147483646)))) is different from false [2022-07-13 02:25:07,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:25:07,331 INFO L93 Difference]: Finished difference Result 352 states and 780 transitions. [2022-07-13 02:25:07,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 02:25:07,332 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-13 02:25:07,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:25:07,333 INFO L225 Difference]: With dead ends: 352 [2022-07-13 02:25:07,333 INFO L226 Difference]: Without dead ends: 352 [2022-07-13 02:25:07,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=121, Invalid=332, Unknown=25, NotChecked=172, Total=650 [2022-07-13 02:25:07,334 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:25:07,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 222 Unchecked, 0.1s Time] [2022-07-13 02:25:07,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-07-13 02:25:07,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 303. [2022-07-13 02:25:07,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 279 states have (on average 2.4551971326164876) internal successors, (685), 302 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:25:07,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 685 transitions. [2022-07-13 02:25:07,342 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 685 transitions. Word has length 21 [2022-07-13 02:25:07,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:25:07,342 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 685 transitions. [2022-07-13 02:25:07,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:25:07,348 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 685 transitions. [2022-07-13 02:25:07,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 02:25:07,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:25:07,348 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:25:07,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-13 02:25:07,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:25:07,549 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:25:07,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:25:07,549 INFO L85 PathProgramCache]: Analyzing trace with hash 633155323, now seen corresponding path program 1 times [2022-07-13 02:25:07,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:25:07,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252736131] [2022-07-13 02:25:07,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:25:07,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:25:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:25:07,677 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:25:07,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:25:07,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252736131] [2022-07-13 02:25:07,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252736131] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:25:07,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819315692] [2022-07-13 02:25:07,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:25:07,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:25:07,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:25:07,680 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-13 02:25:07,703 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-13 02:25:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:25:07,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:25:07,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:25:07,794 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-13 02:25:07,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:25:07,851 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-13 02:25:07,894 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 18 treesize of output 13 [2022-07-13 02:25:22,485 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:25:22,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:25:30,633 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_38| Int) (|v_t_funThread1of1ForFork0_~i~0#1_138| Int) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_849 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_169| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_138|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_38| v_ArrVal_848) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_169| v_ArrVal_849) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168|) 2147483646) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_138| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_169|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_38|)))) is different from false [2022-07-13 02:25:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:25:30,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819315692] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:25:30,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:25:30,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2022-07-13 02:25:30,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544252572] [2022-07-13 02:25:30,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:25:30,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 02:25:30,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:25:30,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 02:25:30,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=257, Unknown=20, NotChecked=36, Total=420 [2022-07-13 02:25:30,757 INFO L87 Difference]: Start difference. First operand 303 states and 685 transitions. Second operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:25:30,763 WARN L833 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_38| Int) (|v_t_funThread1of1ForFork0_~i~0#1_138| Int) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_849 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_169| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_138|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_38| v_ArrVal_848) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_169| v_ArrVal_849) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168|) 2147483646) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_138| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_169|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_38|)))) (= |c_~#cache~0.base| 1) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|))) is different from false [2022-07-13 02:25:57,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:25:57,271 INFO L93 Difference]: Finished difference Result 374 states and 872 transitions. [2022-07-13 02:25:57,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 02:25:57,272 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-13 02:25:57,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:25:57,274 INFO L225 Difference]: With dead ends: 374 [2022-07-13 02:25:57,274 INFO L226 Difference]: Without dead ends: 374 [2022-07-13 02:25:57,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 49.1s TimeCoverageRelationStatistics Valid=220, Invalid=566, Unknown=34, NotChecked=110, Total=930 [2022-07-13 02:25:57,275 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 62 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 340 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:25:57,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 0 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 124 Invalid, 0 Unknown, 340 Unchecked, 0.1s Time] [2022-07-13 02:25:57,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-07-13 02:25:57,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 335. [2022-07-13 02:25:57,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 311 states have (on average 2.5112540192926045) internal successors, (781), 334 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:25:57,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 781 transitions. [2022-07-13 02:25:57,283 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 781 transitions. Word has length 21 [2022-07-13 02:25:57,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:25:57,284 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 781 transitions. [2022-07-13 02:25:57,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:25:57,284 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 781 transitions. [2022-07-13 02:25:57,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 02:25:57,284 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:25:57,284 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:25:57,308 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-13 02:25:57,508 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,SelfDestructingSolverStorable21 [2022-07-13 02:25:57,508 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:25:57,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:25:57,508 INFO L85 PathProgramCache]: Analyzing trace with hash 633155344, now seen corresponding path program 1 times [2022-07-13 02:25:57,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:25:57,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320950564] [2022-07-13 02:25:57,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:25:57,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:25:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:25:57,624 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:25:57,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:25:57,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320950564] [2022-07-13 02:25:57,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320950564] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:25:57,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903012484] [2022-07-13 02:25:57,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:25:57,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:25:57,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:25:57,627 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-13 02:25:57,628 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-13 02:25:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:25:57,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:25:57,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:25:57,748 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-13 02:25:57,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:25:57,807 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-13 02:25:57,857 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 18 treesize of output 13 [2022-07-13 02:26:10,877 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:26:10,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:26:20,953 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_173| Int) (|v_t_funThread1of1ForFork0_~i~0#1_142| Int) (v_ArrVal_918 (Array Int Int)) (v_ArrVal_920 Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_142|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_142| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_173|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (<= 0 (+ 2147483649 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_918) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_173| v_ArrVal_920) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172|))))) is different from false [2022-07-13 02:26:21,091 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:26:21,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903012484] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:26:21,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:26:21,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-13 02:26:21,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3050435] [2022-07-13 02:26:21,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:26:21,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:26:21,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:26:21,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:26:21,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=202, Unknown=21, NotChecked=32, Total=342 [2022-07-13 02:26:21,093 INFO L87 Difference]: Start difference. First operand 335 states and 781 transitions. Second operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:26:21,099 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_173| Int) (|v_t_funThread1of1ForFork0_~i~0#1_142| Int) (v_ArrVal_918 (Array Int Int)) (v_ArrVal_920 Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_142|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_142| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_173|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (<= 0 (+ 2147483649 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_918) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_173| v_ArrVal_920) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172|))))) (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|))) is different from false [2022-07-13 02:26:31,707 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172| Int) (|v_t_funThread1of1ForFork0_~i~0#1_142| Int) (v_ArrVal_920 Int)) (or (not (<= (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_142|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_142| 28) |c_~#cache~0.offset|)) (<= 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_920)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172|))))) (= .cse0 (store .cse1 .cse2 0)) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_171| Int) (|v_t_funThread1of1ForFork0_~i~0#1_141| Int) (v_ArrVal_920 Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (and (<= (+ |v_t_funThread1of1ForFork0_~i~0#1_141| 1) |t_funThread1of1ForFork0_~i~0#1|) (<= (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_171|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_141| 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= (store ((as const (Array Int Int)) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_171| v_ArrVal_920) (select |c_#memory_int| 1)))) (= |c_~#cache~0.base| 1) (<= 0 (+ (select .cse1 .cse2) 2147483648)) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_920 Int)) (and (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_920)) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1)))) is different from false [2022-07-13 02:26:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:26:46,282 INFO L93 Difference]: Finished difference Result 419 states and 970 transitions. [2022-07-13 02:26:46,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 02:26:46,283 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-13 02:26:46,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:26:46,285 INFO L225 Difference]: With dead ends: 419 [2022-07-13 02:26:46,285 INFO L226 Difference]: Without dead ends: 419 [2022-07-13 02:26:46,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 48.1s TimeCoverageRelationStatistics Valid=196, Invalid=483, Unknown=35, NotChecked=156, Total=870 [2022-07-13 02:26:46,286 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 673 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:26:46,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 179 Invalid, 0 Unknown, 673 Unchecked, 0.1s Time] [2022-07-13 02:26:46,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-07-13 02:26:46,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 319. [2022-07-13 02:26:46,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 295 states have (on average 2.471186440677966) internal successors, (729), 318 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:26:46,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 729 transitions. [2022-07-13 02:26:46,295 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 729 transitions. Word has length 21 [2022-07-13 02:26:46,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:26:46,295 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 729 transitions. [2022-07-13 02:26:46,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:26:46,295 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 729 transitions. [2022-07-13 02:26:46,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 02:26:46,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:26:46,296 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:26:46,322 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-13 02:26:46,509 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,SelfDestructingSolverStorable22 [2022-07-13 02:26:46,509 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-13 02:26:46,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:26:46,509 INFO L85 PathProgramCache]: Analyzing trace with hash 633186943, now seen corresponding path program 2 times [2022-07-13 02:26:46,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:26:46,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920695590] [2022-07-13 02:26:46,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:26:46,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:26:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:26:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:26:46,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:26:46,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920695590] [2022-07-13 02:26:46,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920695590] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:26:46,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932117250] [2022-07-13 02:26:46,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:26:46,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:26:46,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:26:46,636 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-13 02:26:46,650 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-13 02:26:46,744 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 02:26:46,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:26:46,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:26:46,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:26:46,752 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-13 02:26:46,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:26:46,803 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-13 02:26:46,844 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 18 treesize of output 13